Bounded Induction and Satisfaction Classes

DOI10.1002/malq.19860323107zbMath0622.03025MaRDI QIDQ3758815

Henryk Kotlarski

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1002/malq.19860323107

zbMATH Keywords

Peano Arithmetic; models of arithmetic; end extensions; recursive saturation; pigeonhole principle; satisfaction class; induction axiom; bounded formulas

Mathematics Subject Classification ID

03H15: Nonstandard models of arithmetic

03C62: Models of arithmetic and set theory

Related Items

DISJUNCTIONS WITH STOPPING CONDITIONS, NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE, MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE, Inductive full satisfaction classes, Deflationary truth and pathologies, The omega-rule interpretation of transfinite provability logic, Reflection algebras and conservation results for theories of iterated truth, Truth, disjunction, and induction, A note on the variety of satisfaction classes, Local collection and end-extensions of models of compositional truth, CONSISTENCY AND THE THEORY OF TRUTH, CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION, European Summer Meeting of the Association for Symbolic Logic, (Logic Colloquium '87), Granada, Spain, 1987, European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988