Corpus ID: 2984580

Andrews' Type Theory with Undefinedness

@article{Farmer2014AndrewsTT,
  title={Andrews' Type Theory with Undefinedness},
  author={W. Farmer},
  journal={ArXiv},
  year={2014},
  volume={abs/1406.7492}
}
  • W. Farmer
  • Published 2014
  • Mathematics, Computer Science
  • ArXiv
${\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… Expand

References

SHOWING 1-10 OF 23 REFERENCES
An introduction to mathematical logic and type theory - to truth through proof
  • Peter B. Andrews
  • Mathematics, Computer Science
  • Computer science and applied mathematics
  • 1986
  • 682
  • Highly Influential
  • PDF
Completeness in the Theory of Types
  • L. Henkin
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1950
  • 757
A Partial Functions Version of Church's Simple Theory of Types
  • W. Farmer
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1990
  • 135
Formalizing Undefinedness Arising in Calculus
  • 22
  • PDF
A Simple Type Theory with Partial Functions and Subtypes
  • W. Farmer
  • Mathematics, Computer Science
  • Ann. Pure Appl. Log.
  • 1993
  • 57
A Formulation of the Simple Theory of Types
  • A. Church
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1940
  • 2,073
  • PDF
TPS: A theorem-proving system for classical type theory
  • 93
  • PDF
Intuitionistic Type Theory
  • 163
  • PDF
Theory Interpretation in Simple Type Theory
  • W. Farmer
  • Mathematics, Computer Science
  • HOA
  • 1993
  • 59
  • PDF
Introduction to HOL: a theorem proving environment for higher order logic
  • 1,783
...
1
2
3
...