Turing computability: structural theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1870419
- Turing computability. Theory and applications
- scientific article; zbMATH DE number 1344955
- scientific article; zbMATH DE number 2047478
- Computability theory
- Computability theory
- scientific article; zbMATH DE number 1955470
- scientific article; zbMATH DE number 5810075
- scientific article; zbMATH DE number 1061261
- Computable Structure Theory
Cites work
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 4027415 (Why is no real title available?)
- scientific article; zbMATH DE number 4087652 (Why is no real title available?)
- scientific article; zbMATH DE number 3784863 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1523417 (Why is no real title available?)
- scientific article; zbMATH DE number 841082 (Why is no real title available?)
- scientific article; zbMATH DE number 841089 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- scientific article; zbMATH DE number 3342831 (Why is no real title available?)
- A Splitting Theorem for the N-R.E. Degrees
- A minimal degree less than 0’
- A recursively enumerable degree which will not split over all lesser ones
- A splitting theorem for n-REA degrees
- Algebraic aspects of the computably enumerable degrees.
- Algorithmic randomness and complexity.
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
- Automorphisms of the lattice of recursively enumerable sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Corrigendum to: ``The d.r.e. degrees are not dense
- Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
- D.R.E. Degrees and the Nondiamond Theorem
- Decidability and Invariant Classes for Degree Structures
- Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
- Decomposition and infima in the computably enumerable degrees
- Definability in the Turing degrees
- Definable relations in Turing degree structures
- Degrees of classes of RE sets
- Degrees of recursively enumerable sets which have no maximal supersets
- Degrees of unsolvability: structure and theory
- Differences of Computably Enumerable Sets
- Distributive Initial Segments of the Degrees of Unsolvability
- Downward density of exact degrees
- Embedding finite lattices into the computably enumerable degrees -- a status survey
- Extension of embeddings in the computably enumerable degrees
- Finitely Generated Codings and the Degrees R.E. in a Degree d
- Hierarchies of Boolean algebras
- Interpolating d-r.e. and REA degrees between r.e. degrees
- Interpolation and embedding in the recursively enumerable degrees
- Interpretability and Definability in the Recursively Enumerable Degrees
- Isolation and lattice embeddings
- Lattice embeddings into the recursively enumerable degrees
- Lattice embeddings into the recursively enumerable degrees. II
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- New Computational Paradigms
- Non-uniformity and generalised Sacks splitting
- Nondensity of Double Bubbles in the D.C.E. Degrees
- Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- On Downey's conjecture
- On a hierarchy of sets. III
- On a problem of Ishmukhametov
- On relative enumerability of Turing degrees
- On the Lattice of Recursively Enumerable Sets
- On the degrees less than 0'
- On the existence of a strong minimal pair
- On the r. e. predecessors of d. r. e. degrees
- On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Relative enumerability in the difference hierarchy
- Splitting and cone avoidance in the d.c.e. degrees
- Splitting in 2-computably enumerable degrees with avoiding cones
- Splitting theorems in recursion theory
- Structural theory of degrees of unsolvability: advances and open problems
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
- The d.r.e. degrees are not dense
- The density of the low\(_ 2\) \(n\)-r.e. degrees
- The elementary theory of recursively enumerable sets
- The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
- The jump is definable in the structure of the degrees of unsolvability
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
- The recursively enumerable degrees are dense
- The undecidability of the recursively enumerable degrees
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- Trial and error predicates and the solution to a problem of Mostowski
- Turing Definability in the Ershov Hierarchy
- Working below a \(low_ 2\) recursively enumerable degree
Cited in
(4)
This page was built for publication: Turing computability: structural theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036465)
