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