Indiscernibles and satisfaction classes in arithmetic
From MaRDI portal
Publication:6565571
Recommendations
Cites work
- scientific article; zbMATH DE number 3679820 (Why is no real title available?)
- scientific article; zbMATH DE number 3732051 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 1062120 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- A certain class of models of Peano arithmetic
- Bounded Induction and Satisfaction Classes
- Inductive full satisfaction classes
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
- Models with the ω-property
- Notes on bounded induction for the compositional truth predicate
- On interpretations of arithmetic and set theory
- Recursively saturated models generated by indiscernibles
- Reflection algebras and conservation results for theories of iterated truth
- Set theory with a proper class of indiscernibles
- The structure of models of Peano arithmetic
- Truth, disjunction, and induction
- Variations on a Visserian theme
This page was built for publication: Indiscernibles and satisfaction classes in arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565571)