Indiscernibles and satisfaction classes in arithmetic

DOI10.1007/S00153-024-00915-8MaRDI QIDQ6565571FDOQ6565571

Authors: Ali Enayat 

Publication date: 2 July 2024

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

Recommendations

• ITERATIONS OF SATISFACTION CLASSES AND MODELS OF PEANO ARITHMETIC
• Definable sets and expansions of models of Peano arithmetic
• scientific article; zbMATH DE number 1222926
• A note on the variety of satisfaction classes
• Nonstandard characterizations of recursive saturation and resplendency

zbMATH Keywords

Peano arithmeticsatisfaction classesindiscernibles

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On interpretations of arithmetic and set theory
• Title not available (Why is that?)
• The structure of models of Peano arithmetic
• A certain class of models of Peano arithmetic
• Title not available (Why is that?)
• Recursively saturated models generated by indiscernibles
• Inductive full satisfaction classes
• Bounded Induction and Satisfaction Classes
• Truth, disjunction, and induction
• Models with the ω-property
• Variations on a Visserian theme
• Reflection algebras and conservation results for theories of iterated truth
• Notes on bounded induction for the compositional truth predicate
• Title not available (Why is that?)
• Set theory with a proper class of indiscernibles
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE

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)