Power set recursion
From MaRDI portal
Publication:1346246
DOI10.1016/0168-0072(94)00005-NzbMath0817.03023MaRDI QIDQ1346246
Publication date: 22 March 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)
Related Items (5)
Constructing the constructible universe constructively ⋮ From the weak to the strong existence property ⋮ The scope of Feferman's semi-intuitionistic set theories and his second conjecture ⋮ Characterizing the interpretation of set theory in Martin-Löf type theory ⋮ Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set theory. An introduction to independence proofs
- Maximal sets in \(\alpha\)-recursion theory
- Recursive Functionals and Quantifiers of Finite Types I
- Splitting an α-Recursively Enumerable Set
- Adding a closed unbounded set
- Hyperanalytic Predicates
- Consistency results about ordinal definability
This page was built for publication: Power set recursion