The following pages link to Metarecursive sets (Q5536268):
Displaying 13 items.
- Transfinite recursion and computation in the iterative conception of set (Q510712) (← links)
- Atomic models higher up (Q952493) (← links)
- Ordinal machines and admissible recursion theory (Q1032634) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Post's problem without admissibility (Q1148898) (← links)
- Effective oracles (Q1191173) (← links)
- Theories of Rogers semilattices of analytical numberings (Q2030131) (← links)
- On the reducibility of \(\Pi_ 1^ 1\) sets (Q2547889) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- On a positive set theory with inequality (Q3096082) (← links)
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
- Barwise: Infinitary Logic and Admissible Sets (Q4678932) (← links)
- COMPUTABILITY IN UNCOUNTABLE BINARY TREES (Q5195058) (← links)
