Inductive full satisfaction classes

DOI10.1016/0168-0072(90)90035-ZMaRDI QIDQ920081zbMATH OpenFDO

Authors Henryk Kotlarski, Zygmunt Ratajczyk

Publication date 1990

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(90)90035-Z

zbMATH Keywords

models of arithmeticrapidly growing functionssatisfaction classes

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) First-order arithmetic and fragments (03F30)

Review text

An arithmetized system of \(\omega\)-logic was used by the first author in Z. Math. Logik Gundlagen Math. 32, 531-544 (1986; Zbl 0622.03025) in order to characterize those countable models of PA which have full \(\Delta_ 0\)-inductive satisfaction classes. The present authors extend this system to obtain a complete characterization of models which have full \(\Sigma_ n\)-inductive satisfaction classes. The characterization is in terms of consistency of appropriate systems and proofs are given via a careful proof theoretic analysis of some rapidly growing functions which are defined in a natural way in the language of PA with a predicate symbol for a satisfaction class.

Recommendations

• scientific article; zbMATH DE number 3939365
• More on induction in the language with a satisfaction class
• A note on the variety of satisfaction classes
• Bounded Induction and Satisfaction Classes
• On the End Extension Problem For Δ0-PA(S)

Cites work

• A classification of the ordinal recursive functions
• A combinatorial analysis of functions provably recursive in ΙΣ_n
• A note on satisfaction classes
• Bounded Induction and Satisfaction Classes
• Combinatorial principles concerning approximations of functions
• Construction of Satisfaction Classes for Nonstandard Models
• Full Satisfaction Classes and Recursive Saturation
• scientific article; zbMATH DE number 3689386 (Why is no real title available?)
• scientific article; zbMATH DE number 3700836 (Why is no real title available?)
• scientific article; zbMATH DE number 3528224 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On Languages Which are Based on Non-Standard Arithmetic
• Rapidly growing Ramsey functions
• Satisfaction Classes and Combinatorial Sentences Independent From PA
• The varieties of arboreal experience
• Transfinite recursive progressions of axiomatic theories

Cited in

(13)

• Full satisfaction classes: A survey
• The contribution of Zygmunt Ratajczyk to the foundations of arithmetic
• Interpreting the compositional truth predicate in models of arithmetic
• Reflection algebras and conservation results for theories of iterated truth
• More on lower bounds for partitioning \(\alpha\)-large sets
• A note on the variety of satisfaction classes
• More on induction in the language with a satisfaction class
• Partitioning 𝛼–large sets: Some lower bounds
• scientific article; zbMATH DE number 3939365 (Why is no real title available?)
• Bounded Induction and Satisfaction Classes
• A Model-Theoretic Approach to Ordinal Analysis
• Indiscernibles and satisfaction classes in arithmetic
• Subsystems of true arithmetic and hierarchies of functions

This page was built for publication: Inductive full satisfaction classes

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