Open Access
Spring 1995 Arithmetic with Satisfaction
James Cain
Notre Dame J. Formal Logic 36(2): 299-303 (Spring 1995). DOI: 10.1305/ndjfl/1040248460

Abstract

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).

Citation

Download Citation

James Cain. "Arithmetic with Satisfaction." Notre Dame J. Formal Logic 36 (2) 299 - 303, Spring 1995. https://doi.org/10.1305/ndjfl/1040248460

Information

Published: Spring 1995
First available in Project Euclid: 18 December 2002

zbMATH: 0837.03044
MathSciNet: MR1345750
Digital Object Identifier: 10.1305/ndjfl/1040248460

Subjects:
Primary: 03F30
Secondary: 03B30 , 03C62

Rights: Copyright © 1995 University of Notre Dame

Vol.36 • No. 2 • Spring 1995
Back to Top