The typical constructible object
From MaRDI portal
Recommendations
Cites work
- A new constructive version of Baire's theorem
- Applications of the Baire category theorem
- Category and Measure in Complexity Classes
- Computability and Randomness
- Effective fractal dimensions
- Genericity of weakly computable objects
- scientific article; zbMATH DE number 6691416 (Why is no real title available?)
- scientific article; zbMATH DE number 3117565 (Why is no real title available?)
- On the uniform computational content of computability theory
- Simple Proofs of Some Theorems on High Degrees of Unsolvability
- The Baire category theorem in weak subsystems of second-order arithmetic
- The upper semi-lattice of degrees of recursive unsolvability
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
Cited in
(2)
This page was built for publication: The typical constructible object
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188247)