Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory
From MaRDI portal
Publication:334991
DOI10.1007/S00153-016-0501-ZzbMath1358.03065DBLPjournals/aml/FriedmanLW16OpenAlexW2512550994WikidataQ59459316 ScholiaQ59459316MaRDI QIDQ334991
Tin Lok Wong, Wei Li, Sy-David Friedman
Publication date: 1 November 2016
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-016-0501-z
Nonclassical and second-order set theories (03E70) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)
Related Items (3)
End extending models of set theory via power admissible covers ⋮ On the relative strengths of fragments of collection ⋮ INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The degree of a \(\Sigma_ n\) cut
- On interpretations of arithmetic and set theory
- Some More Minimal Pairs of α‐Recursively Enumerable Degrees
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- An introduction to γ-recursion theory (or what to do in KP – Foundation)
- Σ2-collection and the infinite injury priority method
- Finite injury and Σ1-induction
- β-Recursion Theory
- A proof-theoretic characterization of the primitive recursive set functions
- Splitting an α-Recursively Enumerable Set
- On minimal pairs and minimal degrees in higher recursion theory
- The recursively enumerable α-degrees are dense
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- The Sacks density theorem and Σ2-bounding
- The natural numbers in constructive set theory
- The α-finite injury method
- Some minimal pairs of α-recursively enumerable degrees
This page was built for publication: Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory