Bounded Induction and Satisfaction Classes

DOI10.1002/MALQ.19860323107MaRDI QIDQ3758815zbMATH OpenOpenAlexFDO

Authors 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

bounded formulasend extensionsinduction axiommodels of arithmeticPeano Arithmeticpigeonhole principlerecursive saturationsatisfaction class

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Recommendations

• scientific article; zbMATH DE number 3939365
• On the End Extension Problem For Δ0-PA(S)
• Inductive full satisfaction classes
• More on induction in the language with a satisfaction class
• Structures interpretable in models of bounded arithmetic

Cited in

(30)

• On interpretations of bounded arithmetic and bounded set theory
• The omega-rule interpretation of transfinite provability logic
• Reflection algebras and conservation results for theories of iterated truth
• Truth, disjunction, and induction
• Structures interpretable in models of bounded arithmetic
• A note on the variety of satisfaction classes
• Local collection and end-extensions of models of compositional truth
• Consistency and the theory of truth
• More on induction in the language with a satisfaction class
• 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
• scientific article; zbMATH DE number 3912375 (Why is no real title available?)
• scientific article; zbMATH DE number 3939365 (Why is no real title available?)
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• An Effective Conservation Result for Nonstandard Arithmetic
• DISJUNCTIONS WITH STOPPING CONDITIONS
• Notes on bounded induction for the compositional truth predicate
• On a Problem of J. Paris
• Bounded finite set theory
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
• Indiscernibles and satisfaction classes in arithmetic
• A theory of implicit commitment
• Reflexivity of -consistency in a general setting
• Satisfaction classes with approximate disjunctive correctness
• Passive induction and a solution to a Paris-Wilkie open question
• Inductive full satisfaction classes
• Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).
• Deflationary truth and pathologies

This page was built for publication: Bounded Induction and Satisfaction Classes

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