Hostname: page-component-7b7567c8c-2jgqx Total loading time: 0 Render date: 2026-11-19T18:12:03.283Z Has data issue: false hasContentIssue false

PROOF-THEORETIC SEMANTIC VALUES FOR LOGICAL OPERATORS

Published online by Cambridge University Press:  07 September 2011

NISSIM FRANCEZ*
Affiliation:
Computer Science Department, The Technion-IIT
GILAD BEN-AVI*
Affiliation:
Computer Science Department, The Technion-IIT
*
*COMPUTER SCIENCE DEPARTMENT, THE TECHNION-IIT, HAIFA, ISRAEL. E-mail:francez@cs.technion.ac.il
†COMPUTER SCIENCE DEPARTMENT, THE TECHNION-IIT, HAIFA, ISRAEL. E-mail:bagilad@cs.technion.ac.il
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The paper proposes a semantic value for the logical constants (connectives and quantifiers) within the framework of proof-theoretic semantics, basic meaning on the introduction rules of a meaning conferring natural deduction proof system. The semantic value is defined based on Frege’s Context Principle, by taking “contributions” to sentential meanings as determined by the function-argument structure as induced by a type-logical grammar. In doing so, the paper proposes a novel proof-theoretic interpretation of the semantic types, traditionally interpreted in Henkin models. The compositionality of the resulting attribution of semantic values is discussed. Elsewhere, the same method was used for defining proof-theoretic meaning of subsentential phrases in a fragment of natural language. Doing the same for (the simpler and clearer case of) logic sheds more light on the proposal.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011