Journal of Symbolic Logic 55 (3):1269-1291 (1990)
|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|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Kc Klement (2010). The Senses of Functions in the Logic of Sense and Denotation. The Bulletin of Symbolic Logic 16 (2):153-188.
Solomon Feferman (1995). Definedness. Erkenntnis 43 (3):295 - 320.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
François Lepage (2000). Partial Monotonic Protothetics. Studia Logica 66 (1):147-163.
William M. Farmer (1995). Reasoning About Partial Functions with the Aid of a Computer. Erkenntnis 43 (3):279 - 294.
William M. Farmer & Joshua D. Guttman (2000). A Set Theory with Support for Partial Functions. Studia Logica 66 (1):59-78.
Added to index2009-01-28
Total downloads3 ( #213,130 of 722,704 )
Recent downloads (6 months)1 ( #60,247 of 722,704 )
How can I increase my downloads?