Full Satisfaction Classes and Recursive Saturation

DOI10.4153/CMB-1981-046-0zbMath0471.03055MaRDI QIDQ3924206

Alistair H. Lachlan

Publication date: 1981

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

Peano arithmetic

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Models with special properties (saturated, rigid, etc.) (03C50)

Related Items

Relative Truth Definability of Axiomatic Truth Theories, A note on the variety of satisfaction classes, Full satisfaction classes, definability, and automorphisms, Local collection and end-extensions of models of compositional truth, Remarks on weak notions of saturation in models of Peano arithmetic, Disquotational truth and analyticity, CLASSICAL DETERMINATE TRUTH I, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Nonstandard definability, Inductive full satisfaction classes, More on Systems of Truth and Predicative Comprehension, Possible-worlds semantics for modal notions conceived as predicates, Truth and the philosophy of mathematics, MINIMAL TRUTH AND INTERPRETABILITY, DISJUNCTIONS WITH STOPPING CONDITIONS, A note on typed truth and consistency assertions