Cites work
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- A Theorem on Hypersimple Sets
- Arithmetical representation of recursively enumerable sets
- Creative sets
- Degrees of Computability
- Examples of sets definable by means of two and three quantifiers
- Gödel numberings of partial recursive functions
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On definable sets of positive integers
- On degrees of recursive unsolvability
- Recursive Predicates and Quantifiers
- Recursively enumerable sets of positive integers and their decision problems
- Reducibility and Completeness for Sets of Integers
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- The upper semi-lattice of degrees of recursive unsolvability
Cited in
(15)- Calculable enumerations and equivalence relations
- Elementary Differences Between the Isols and the Co-Simple Isols
- On index sets
- Kleene index sets and functional m-degrees
- Index sets related to prompt simplicity
- scientific article; zbMATH DE number 3478858 (Why is no real title available?)
- On the Degrees of Index Sets
- Recursively enumerable sets and degrees
- The index sets of m-degrees
- Constructive Analogues of the Group of Permutations of the Natural Numbers
- A discrete chain of degrees of index sets
- The use of lists in the study of undecidable problems in automata theory
- There exists a maximal 3-c.e. enumeration degree
- Index sets and presentations of complexity classes
- The Kleene Hierarchy Classification of Recursively Random Sequences
This page was built for publication: Computing degrees of unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q770790)
