Full Satisfaction Classes and Recursive Saturation

DOI10.4153/CMB-1981-046-0MaRDI QIDQ3924206zbMATH OpenFDO

Authors Alistair H. Lachlan

Publication date 1981

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

Full work available at URL https://doi.org/10.4153/CMB-1981-046-0

zbMATH Keywords

Peano arithmetic

Mathematics Subject Classification ID

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

Cited in

(18)

• Possible-worlds semantics for modal notions conceived as predicates
• Truth and the philosophy of mathematics
• Full satisfaction classes, definability, and automorphisms
• A note on typed truth and consistency assertions
• A note on the variety of satisfaction classes
• Local collection and end-extensions of models of compositional truth
• Relative Truth Definability of Axiomatic Truth Theories
• More on Systems of Truth and Predicative Comprehension
• Remarks on weak notions of saturation in models of Peano arithmetic
• Disquotational truth and analyticity
• DISJUNCTIONS WITH STOPPING CONDITIONS
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS
• Minimal truth and interpretability
• CLASSICAL DETERMINATE TRUTH I
• Saturation properties for compositional truth with propositional correctness
• An isomorphism theorem for models of weak König's lemma without primitive recursion
• Nonstandard definability
• Inductive full satisfaction classes

This page was built for publication: Full Satisfaction Classes and Recursive Saturation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924206)