TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited In (83)

Extensions of Hilbert's tenth problem: definability and decidability in number theory
Metarecursively enumerable sets and admissible ordinals
Recursively enumerable sets which are uniform for finite extensions
Pseudo-complements and ordinal logics based on consistency statements
A cornucopia of minimal degrees
The typical constructible object
European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991
Definable incompleteness and Friedberg splittings
Naturalness in mathematics
Iterated priority arguments in descriptive set theory
The post correspondence problem
There is no degree invariant half-jump
Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
Orbits of computably enumerable sets: Low sets can avoid an upper cone
The combinatorics of the splitting theorem
Call-by-value lambda calculus as a model of computation in Coq
A theorem on minimal degrees
Initial segments of the degrees of unsolvability Part II: minimal degrees
Undecidability and 1-types in the recursively enumerable degrees
The distribution of the generic recursively enumerable degrees
Collapsing degrees
The bounded injury priority method and the learnability of unions of rectangles
Not every finite lattice is embeddable in the recursively enumerable degrees
Recursive Enumerability and the Jump Operator
On unstable and unoptimal prediction
Forcing and reducibilities
Recursively enumerable degress and the conjugacy problem
Resource bounded immunity and simplicity
A minimal degree less than 0’
On the structures inside truth-table degrees
On a Problem of G. E. Sacks
On \(n\)-tardy sets
On the Degrees of Index Sets
Finite injury and Σ₁-induction
Measure-theoretic construction of incomparable hyperdegrees
Non-p-generic and strongly nonbranching degree
On Reducibility by Recursive Functions
Classification of computably approximable real numbers
Extensions of embeddings below computably enumerable degrees
Computing degrees of unsolvability
Things that can be made into themselves
Coding a family of sets
Intervals containing exactly one c.e. degree
The minimum of two regressive isols
A Simple Set Which is Not Effectively Simple
Computational processes, observers and Turing incompleteness
Metarecursively enumerable sets and their metadegrees
On the cutting edge of relativization: The resource bounded injury method
Ramsey's theorem and recursion theory
The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees
Bounding minimal degrees by computably enumerable degrees
An easy priority-free proof of a theorem of Friedberg
Post's problem for ordinal register machines: an explicit approach
Turing oracle machines, online computing, and three displacements in computability theory
On the Turing degrees of minimal index sets
Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable
Is it harder to factor a polynomial or to find a root?
A minimal pair of recursively enumerable degrees
Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
Recursively enumerable sets and degrees
Extending and interpreting Post's programme
Incomparable prime ideals of recursively enumerable degrees
Computational classification of cellular automata
La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
Degree Structures: Local and Global Investigations
THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
Lattice nonembeddings and intervals of the recursively enumerable degrees
Non-p-generic and strongly nonbranching degree
Combinatorial systems defined over one- and two-letter alphabets
A General Framework for Priority Arguments
Metarecursive sets
Definability in the Recursively Enumerable Degrees
On the reducibility of \(\Pi_ 1^ 1\) sets
Representation of one-one degrees by decision problems for system functions
An explicit solution to Post's problem over the reals
On Lachlan's major sub-degree problem
A pseudofundamental sequence that is not equivalent to any monotone sequence
Hierarchy of Computably Enumerable Degrees II
An extension of the nondiamond theorem in classical and α-recursion theory
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
The decision problem for recursively enumerable degrees
As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number fields

This page was built for publication: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3248015)