Indiscernibles and satisfaction classes in arithmetic

DOI10.1007/s00153-024-00915-8MaRDI QIDQ6565571

Ali Enayat

Publication date: 2 July 2024

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

Peano arithmeticindiscerniblessatisfaction classes

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Relative consistency and interpretations (03F25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inductive full satisfaction classes
• Recursively saturated models generated by indiscernibles
• Reflection algebras and conservation results for theories of iterated truth
• Truth, disjunction, and induction
• On interpretations of arithmetic and set theory
• A certain class of models of Peano arithmetic
• Bounded Induction and Satisfaction Classes
• Models with the ω-property
• Set theory with a proper class of indiscernibles
• Variations on a Visserian Theme
• NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE

This page was built for publication: Indiscernibles and satisfaction classes in arithmetic