Turing computability: structural theory (Q2036465)

scientific article; zbMATH DE number 7364536

Language	Label	Description	Also known as
English	Turing computability: structural theory	scientific article; zbMATH DE number 7364536

Statements

instance of

scholarly article

0 references

title

Turing computability: structural theory (English)

0 references

0 references

0 references

Journal of Mathematical Sciences (New York)

0 references

publication date

29 June 2021

0 references

zbMATH Keywords

computably enumerable set

0 references

Turing degree

0 references

Ershov's hierarchy

0 references

definability

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s10958-021-05418-y

0 references

cites work

An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees

0 references

Lattice embeddings into the recursively enumerable degrees

0 references

Lattice embeddings into the recursively enumerable degrees. II

0 references

Nondensity of Double Bubbles in the D.C.E. Degrees

0 references

Q3816068

0 references

Definable relations in Turing degree structures

0 references

Structural theory of degrees of unsolvability: advances and open problems

0 references

Q4511553

0 references

On Downey's conjecture

0 references

Relative enumerability in the difference hierarchy

0 references

Q4863238

0 references

Interpolating $d$-r.e. and REA degrees between r.e. degrees

0 references

On the existence of a strong minimal pair

0 references

The $n$-r.e. degrees: undecidability and $\Sigma_1$ substructures

0 references

Automorphisms of the lattice of recursively enumerable sets

0 references

ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS

0 references

The jump is definable in the structure of the degrees of unsolvability

0 references

The density of the low$_ 2$ $n$-r.e. degrees

0 references

A Splitting Theorem for the N-R.E. Degrees

0 references

The d.r.e. degrees are not dense

0 references

Corrigendum to: ``The d.r.e. degrees are not dense''

0 references

Non-uniformity and generalised Sacks splitting

0 references

Splitting and cone avoidance in the d.c.e. degrees

0 references

Turing Definability in the Ershov Hierarchy

0 references

D.R.E. Degrees and the Nondiamond Theorem

0 references

Algorithmic Randomness and Complexity

0 references

Decomposition and infima in the computably enumerable degrees

0 references

Splitting theorems in recursion theory

0 references

The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$

0 references

Degrees of unsolvability: structure and theory

0 references

Q5619076

0 references

Q5619077

0 references

On a hierarchy of sets. III

0 references

Q3768858

0 references

Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$

0 references

On a problem of Ishmukhametov

0 references

Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy

0 references

Hierarchies of Boolean algebras

0 references

The undecidability of the recursively enumerable degrees

0 references

The Δ₃⁰-automorphism method and noninvariant classes of degrees

0 references

On the r. e. predecessors of d. r. e. degrees

0 references

On relative enumerability of Turing degrees

0 references

Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

0 references

Lower Bounds for Pairs of Recursively Enumerable Degrees

0 references

The elementary theory of recursively enumerable sets

0 references

Degrees of recursively enumerable sets which have no maximal supersets

0 references

Distributive Initial Segments of the Degrees of Unsolvability

0 references

On the Lattice of Recursively Enumerable Sets

0 references

A recursively enumerable degree which will not split over all lesser ones

0 references

Q5494233

0 references

Differences of Computably Enumerable Sets

0 references

The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable

0 references

Q3329452

0 references

Q4863245

0 references

Decidability and Invariant Classes for Degree Structures

0 references

The elementary theory of the recursively enumerable degrees is not $\aleph _ 0$-categorical

0 references

New Computational Paradigms

0 references

Cupping the Recursively Enumerable Degrees by D.R.E. Degrees

0 references

Downward density of exact degrees

0 references

Classes of Recursively Enumerable Sets and Degrees of Unsolvability

0 references

Q3962986

0 references

Interpretability and Definability in the Recursively Enumerable Degrees

0 references

Trial and error predicates and the solution to a problem of Mostowski

0 references

Interpolation and embedding in the recursively enumerable degrees

0 references

Q5573961

0 references

A minimal degree less than 0’

0 references

On the degrees less than 0'

0 references

The recursively enumerable degrees are dense

0 references

Degrees of classes of RE sets

0 references

Finitely Generated Codings and the Degrees R.E. in a Degree d

0 references

Working below a $low_ 2$ recursively enumerable degree

0 references

A splitting theorem for $n$-REA degrees

0 references

Algebraic aspects of the computably enumerable degrees.

0 references

Extension of embeddings in the computably enumerable degrees

0 references

Definability in the Turing degrees

0 references

Q4040892

0 references

Isolation and lattice embeddings

0 references

Splitting in 2-computably enumerable degrees with avoiding cones

0 references

On Σ<sub>1</sub>-Structural Differences Among Finite Levels of the Ershov Hierarchy

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10958-021-05418-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2036465