Arithmetic with Satisfaction

Notre Dame Journal of Formal Logic 36 (2):299-303 (1995)
  Copy   BIBTEX

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)

Other Versions

No versions found

Similar books and articles

The Theory of Computability Developed in Terms of Satisfaction.James Cain - 1999 - Notre Dame Journal of Formal Logic 40 (4):515-532.
Universal properties of truth.Mateusz Łełyk & Bartosz Wcisło - 2026 - Journal of Mathematical Logic 26 (2).
Universal properties of truth.Mateusz Łełyk & Bartosz Wcisło - 2025 - Journal of Mathematical Logic 26 (2).
Basic Predicate Calculus.Wim Ruitenburg - 1998 - Notre Dame Journal of Formal Logic 39 (1):18-46.
Satisfaction is Not Absolute.Joel David Hamkins & Ruizhi Yang - forthcoming - Review of Symbolic Logic.
Theories of truth and semantical primitives.Philip Hugly & Charles Sayward - 1977 - Journal of Philosophical Logic 6 (1):349 - 354.
Frege's Other Program.Aldo Antonelli & Robert May - 2005 - Notre Dame Journal of Formal Logic 46 (1):1-17.
Undefinability vs. Definability of Satisfaction and Truth.Roman Murawski - 1999 - Vienna Circle Institute Yearbook 6:203-215.

Analytics

Added to PP
2010-08-24

Downloads
692 (#83,895)

6 months
65 (#146,295)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

James Cain
Oklahoma State University

Citations of this work

No citations found.

Add more citations

References found in this work

Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Semantics and the liar paradox.Albert Visser - 1989 - Handbook of Philosophical Logic 4 (1):617--706.

Add more references