Andrews' Type Theory with Undefinedness
William M. Farmer

TL;DR
This paper introduces ${ m Q}_0^{ m u}$, a modification of Andrews' type theory that formalizes the traditional approach to undefined terms, and proves its soundness and completeness.
Contribution
It presents ${ m Q}_0^{ m u}$, a new type theory formalizing undefinedness, with proven soundness and completeness, extending Andrews' ${ m Q}_0$.
Findings
${ m Q}_0^{ m u}$ is sound and complete.
The development closely follows Andrews' ${ m Q}_0$.
Formalizes the traditional approach to undefinedness.
Abstract
is an elegant version of Church's type theory formulated and extensively studied by Peter B. Andrews. Like other traditional logics, does not admit undefined terms. The "traditional approach to undefinedness" in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements. is a modification of Andrews' type theory that directly formalizes the traditional approach to undefinedness. This paper presents and proves that the proof system of is sound and complete with respect to its semantics which is based on Henkin-style general models. The paper's development of closely follows Andrews' development of to clearly delineate the differences between the two systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Advanced Algebra and Logic
