Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 58, Issue 2 (1993), 477-513.
Extending the First-Order Theory of Combinators with Self-Referential Truth
The aim of this paper is to introduce a formal system STW of self-referential truth, which extends the classical first-order theory of pure combinators with a truth predicate and certain approximation axioms. STW naturally embodies the mechanisms of general predicate application/abstraction on a par with function application/abstraction; in addition, it allows non-trivial constructions, inspired by generalized recursion theory. As a consequence, STW provides a smooth inner model for Myhill's systems with levels of implication.
J. Symbolic Logic Volume 58, Issue 2 (1993), 477-513.
First available in Project Euclid: 6 July 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Cantini, Andrea. Extending the First-Order Theory of Combinators with Self-Referential Truth. J. Symbolic Logic 58 (1993), no. 2, 477--513. https://projecteuclid.org/euclid.jsl/1183744244.