Corpus ID: 13624723

Satisfaction Classes in Nonstandard Models of First-Order Arithmetic

  title={Satisfaction Classes in Nonstandard Models of First-Order Arithmetic},
  author={F. Engstr{\"o}m},
  journal={Mathematics eJournal},
  • F. Engström
  • Published 2002
  • Chemistry, Mathematics
  • Mathematics eJournal
A satisfaction class is a set of nonstandard sentences respecting Tarski's truth definition. We are mainly interested in full satisfaction classes, i.e., satisfaction classes which decides all nonstandard sentences. Kotlarski, Krajewski and Lachlan proved in 1981 that a countable model of PA admits a satisfaction class if and only if it is recursively saturated. A proof of this fact is presented in detail in such a way that it is adaptable to a language with function symbols. The idea that a… Expand
Deflationary Truth and Pathologies
It is shown that a certain natural closure condition imposed on a satisfaction class—namely, closure of truth under sentential proofs—generates a nonconservative extension of a syntactic base theory (Peano arithmetic). Expand
A case for satisfaction classes: model theoretic vs axiomatic approaches to the notion of truth
One of the basic question we can ask about truth in a formal setting is what, if anything, we gain when we have a truth predicate at disposal. For example, does the expressive power of a languageExpand
L O ] 2 4 M ay 2 01 8 Truth , Disjunction , and Induction
By a well-known result of Kotlarski, Krajewski, and Lachlan (1981), first-order Peano arithmetic PA can be conservatively extended to the theory CT−[PA] of a truth predicate satisfying compositionalExpand
Compositional truth with propositional tautologies and quantifier-free correctness
Cieślinski asked whether compositional truth theory with the additional axiom that all propositional tautologies are true is conservative over Peano Arithmetic. We provide a partial answer to thisExpand
Mathematisches Forschungsinstitut Oberwolfach Report No . 52 / 2006 Mini-Workshop : Logic , Combinatorics and Independence Results
This is a collection of extended abstracts of a mini-workshop “Logic, Combinatorics and Independence results” that took place on November 25 – December 2, 2006 in Oberwolfach. The mini-workshop wasExpand
The two halves of disjunctive correctness
Ali Enayat had asked whether two halves of Disjunctive Correctness (DC) for the compositional truth predicate are conservative over Peano Arithmetic. In this article, we show that the principleExpand
Transplendent Models: Expansions Omitting a Type
Two different formulations of resplendency are investigated and necessary and sufficient conditions for countable recursively saturated models of PA are proved. Expand
Interpreting the compositional truth predicate in models of arithmetic
We present a construction of a truth class (an interpretation of a compositional truth predicate) in an arbitrary countable recursively saturated model of first-order arithmetic. The construction isExpand
Truth, disjunction, and induction
A new general form of Visser’s theorem on non-existence of infinite descending chains of truth definitions is developed by reduction to Gödel's second incompleteness theorem, rather than by using the VISSer–Yablo paradox, as in Vissers original proof. Expand
New Constructions of Satisfaction Classes
We use model-theoretic ideas to present a perspicuous and versatile method of constructing full satisfaction classes on models of Peano arithmetic. We also comment on the ramifications of our work onExpand


An Introduction to Recursively Saturated and Resplendent Models
The notions of recursively saturated and resplendent models grew out of the study of admissible sets with urelements and admissible fragments of L ω1ω , but, when applied to ordinary first orderExpand
Inductive Full Satisfaction Classes
A condition is given on T ⊇ PA which is equivalent (for countable and recursively saturated M ⊨ T) to the existence of a full inductive satisfaction class for M for Σn-inductive full satisfaction classes. Expand
Introduction to mathematical logic
  • H. Hermes
  • Mathematics, Computer Science
  • Universitext
  • 1973
This book discusses the semantics of Predicate Logic, and some of theorems of A. Robinson, Craig and Beth's treatment of Peano's Axiom System. Expand
The Blackwell guide to philosophical logic
List of Contributors. Preface. Introduction: Lou Goble (Willamette University). 1. Classical Logic I - First-Order Logic: Wilfrid Hodges (Queen Mary and Westfield College, University of London). 2.Expand
Metamathematics of First-Order Arithmetic
This chapter discusses Arithmetic as Number Theory, Set Theory and Logic, Fragments and Combinatorics, and Models of Fragments of Arithmetic. Expand
Models of Peano Arithmetic
What do you do to start reading models of peano arithmetic? Searching the book that you love to read first or find an interesting book that will make you want to read? Everybody has difference withExpand
Abstract: About a decade ago, biophysicists observed an approximately linear relationship between the combinatorial complexity of knotted DNA and the distance traveled in gel electrophoresisExpand
Phd by thesis
Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though mostExpand
pages 258–279
  • Blackwell, Oxford,
  • 2001
Simson on Porisms