The following pages link to (Q5625138):
Displaying 19 items.
- Approximating sets with equivalence relations (Q1099631) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Functional interpretation of Aczel's constructive set theory (Q1577478) (← links)
- Patterns of resemblance and Bachmann-Howard fixed points (Q2064043) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Predicatively computable functions on sets (Q2339966) (← links)
- The Shoenfield absoluteness lemma (Q2542514) (← links)
- OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES (Q2795911) (← links)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609) (← links)
- Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)
- The gap‐two cardinal problem for uncountable languages (Q5109228) (← links)
- Set-theoretic reflection is equivalent to induction over well-founded classes (Q5117344) (← links)
- Computable aspects of the Bachmann–Howard principle (Q5118047) (← links)
- A categorical construction of Bachmann–Howard fixed points (Q5205443) (← links)
- On λ-Definable Functions on Ordinals (Q5326365) (← links)
- Hierarchien primitiv-rekursiver Funktionen im Transfiniten (Q5655351) (← links)
- Effective randomness for continuous measures (Q5862176) (← links)
- Logical problems of functional interpretations (Q5957851) (← links)
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension (Q6080077) (← links)