Inductive full satisfaction classes

DOI10.1016/0168-0072(90)90035-ZzbMath0708.03014MaRDI QIDQ920081

Zygmunt Ratajczyk, Henryk Kotlarski

Publication date: 1990

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

zbMATH Keywords

models of arithmeticsatisfaction classesrapidly growing functions

Mathematics Subject Classification ID

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

Related Items (8)

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 ⋮ The contribution of Zygmunt Ratajczyk to the foundations of arithmetic ⋮ A Model-Theoretic Approach to Ordinal Analysis ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ Interpreting the compositional truth predicate in models of arithmetic ⋮ Partitioning 𝛼–large sets: Some lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The varieties of arboreal experience
• Rapidly growing Ramsey functions
• A note on satisfaction classes
• Satisfaction Classes and Combinatorial Sentences Independent From PA
• Bounded Induction and Satisfaction Classes
• Combinatorial principles concerning approximations of functions
• A combinatorial analysis of functions provably recursive in $ΙΣ_n$
• Construction of Satisfaction Classes for Nonstandard Models
• Full Satisfaction Classes and Recursive Saturation
• On Languages Which are Based on Non-Standard Arithmetic
• A classification of the ordinal recursive functions
• Transfinite recursive progressions of axiomatic theories

This page was built for publication: Inductive full satisfaction classes