Cites work
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- On the degrees less than 0'
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Recursively enumerable sets of positive integers and their decision problems
- The recursively enumerable degrees are dense
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
Cited in
(18)- Ordinal machines and admissible recursion theory
- Descriptive characterizations of computational complexity
- Post's problem without admissibility
- Effective oracles
- Theories of Rogers semilattices of analytical numberings
- On the reducibility of \(\Pi_ 1^ 1\) sets
- Enumeration reducibility and computable structure theory
- On a positive set theory with inequality
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- Minimal Covers and Hyperdegrees
- Barwise: Infinitary Logic and Admissible Sets
- Transfinite recursion and computation in the iterative conception of set
- Computability in uncountable binary trees
- THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
- Metarecursively enumerable sets and admissible ordinals
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- Persistent and invariant formulas relative to theories of higher order
- Atomic models higher up
This page was built for publication: Metarecursive sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536268)
