The following pages link to (Q5537368):
Displaying 15 items.
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- Higher Kurtz randomness (Q636362) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- Lowness of higher randomness notions (Q948873) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- On revision operators (Q3160562) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- AN APPLICATION OF RECURSION THEORY TO ANALYSIS (Q3386607) (← links)
- On the Π<sub>1</sub> <sup>1</sup> -separation principle (Q3545211) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- Recursive Pseudo-Well-Orderings (Q5579489) (← links)
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory (Q5609369) (← links)
- Degrees of Nonrecursive Presentability (Q5681987) (← links)