Abstract
Simple type theory is a higher-order predicate logic for reasoning about truth values, individuals, and simply typed total functions. We present in this paper a version of simple type theory, called PF *, in which functions may be partial and types may have subtypes. We define both a Henkin-style general models semantics and an axiomatic system for PF *, and we prove that the axiomatic system is complete with respect to the general models semantics. We also define a notion of an interpretation of one PF * theory in another. PF * is intended as a foundation for mechanized mathematics. It is the basis for the logic of IMPS, an Interactive Mathematical Proof System developed at The MITRE Corporation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
