A partial functions version of church's simple theory of types

Journal of Symbolic Logic 55 (3):1269-1291 (1990)
  Copy   BIBTEX

Abstract

Church's simple theory of types is a system of higher-order logic in which functions are assumed to be total. We present in this paper a version of Church's system called PF in which functions may be partial. The semantics of PF, which is based on Henkin's general-models semantics, allows terms to be nondenoting but requires formulas to always denote a standard truth value. We prove that PF is complete with respect to its semantics. The reasoning mechanism in PF for partial functions corresponds closely to mathematical practice, and the formulation of PF adheres tightly to the framework of Church's system

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
53 (#268,373)

6 months
3 (#445,838)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On Denoting.Bertrand Russell - 1905 - Mind 14 (56):479-493.
Singular terms, truth-value gaps, and free logic.Bas C. van Fraassen - 1966 - Journal of Philosophy 63 (17):481-495.
On second-order logic.George S. Boolos - 1975 - Journal of Philosophy 72 (16):509-527.
Sense without Denotation.Timothy Smiley - 1959 - Analysis 20 (6):125 - 135.
Existential import revisited.Karel Lambert - 1963 - Notre Dame Journal of Formal Logic 4 (4):288-292.

View all 8 references / Add more references