Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 36, Number 2 (1995), 299-303.
Arithmetic with Satisfaction
A language in which we can express arithmetic and which contains its own satisfaction predicate (in the style of Kripke's theory of truth) can be formulated using just two nonlogical primitives: $'$ (the successor function) and Sat (a satisfaction predicate).
Notre Dame J. Formal Logic, Volume 36, Number 2 (1995), 299-303.
First available in Project Euclid: 18 December 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03F30: First-order arithmetic and fragments
Secondary: 03B30: Foundations of classical theories (including reverse mathematics) [See also 03F35] 03C62: Models of arithmetic and set theory [See also 03Hxx]
Cain, James. Arithmetic with Satisfaction. Notre Dame J. Formal Logic 36 (1995), no. 2, 299--303. doi:10.1305/ndjfl/1040248460. https://projecteuclid.org/euclid.ndjfl/1040248460