Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T09:02:07.806Z Has data issue: false hasContentIssue false
  • English
  • Français

PROOF-THEORETIC SEMANTIC VALUES FOR LOGICAL OPERATORS

Published online by Cambridge University Press:  07 September 2011

NISSIM FRANCEZ  and
GILAD BEN-AVI
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:[email protected]
†COMPUTER SCIENCE DEPARTMENT, THE TECHNION-IIT, HAIFA, ISRAEL. E-mail:[email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
The Review of Symbolic Logic , Volume 4 , Issue 3 , September 2011 , pp. 466 - 478
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

Francez, N., & Dyckhoff, R. (2010). Proof-theoretic semantics for a natural language fragment. In Ebert, C., Jaeger, G., and Michaelis, J., editors. MOL 10/11 (Proceedings of the 10th and 11th meetings of the Association for Mathematics of Language, Los-Angeles, CA, July 2007), LNAI 6149. Berlin Heidelberg, Germany: Springer-Verlag, pp. 56–71. Full version accepted to Linguistics and Philosophy.Google Scholar
Francez, N., Dyckhoff, R., & Ben-Avi, G. (2010). Proof-theoretic semantics for subsentential phrases. Studia Logica, 94, 381–401.CrossRefGoogle Scholar
Frege, G. (1884). Grundlagen der Aritmetik. Translated as The Foundations of Arithmetic (1953) by Austin, J. L. (trans.), second edition. Oxford, UK: Basil Blackwell.Google Scholar
Hodges, W. (2001). Formal features of compositionality. Journal of Logic, Language, and Information, 10, 7–28.CrossRefGoogle Scholar
Moortgat, M. (1997). Categorial type logics. In van Benthem, J., and ter Meulen, A., editors. Handbook of Logic and Language. Amsterdam, The Netherlands: North Holland, pp. 93–178.CrossRefGoogle Scholar
Pagin, P. (2009). Compositionality, understanding, and proofs. Mind, 118(471), 713–737.CrossRefGoogle Scholar
Peregrin, J. (2009). Inferentialism and the compositionality of meaning. International Review of Pragmatics, 1, 154–181.CrossRefGoogle Scholar
Schroeder-Heister, P. (2011). The categorical and the hypothetical: A critique of some fundamental assumptions of standard semantics. In Palmgren, E., Lindström, S., and Westerstähl, D., editors. The philosophy of logical consequence and inference. Berlin Heidelberg, Germany, Springer-Verlag: To appear. Special issue of Synthese.Google Scholar
Wansing, H. (2010). Proofs, disproofs, and their duals. In Goranko, V., Beklemishev, L., and Shehtman, V., editors. Advances in Modal Logic 2010. London, UK: College Publications, pp. 483–505.Google Scholar
Wieckowski, B. (2011). Rules for subatomic derivation. Review of Symbolic Logic. To appear.CrossRefGoogle Scholar