Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Andrews' Type Theory with Undefinedness (1406.7492v1)

Published 29 Jun 2014 in math.LO and cs.LO

Abstract: ${\cal Q}0$ is an elegant version of Church's type theory formulated and extensively studied by Peter B. Andrews. Like other traditional logics, ${\cal Q}_0$ 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. ${\cal Q}{\rm u}{0}$ is a modification of Andrews' type theory ${\cal Q}0$ that directly formalizes the traditional approach to undefinedness. This paper presents ${\cal Q}{\rm u}{0}$ and proves that the proof system of ${\cal Q}{\rm u}{0}$ is sound and complete with respect to its semantics which is based on Henkin-style general models. The paper's development of ${\cal Q}{\rm u}{0}$ closely follows Andrews' development of ${\cal Q}_0$ to clearly delineate the differences between the two systems.

Summary

We haven't generated a summary for this paper yet.