Recursively enumerable many-one degrees

DOI10.1007/BF02218612zbMath0287.02028OpenAlexW1996842106MaRDI QIDQ1845719

Alistair H. Lachlan

Publication date: 1973

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02218612

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (14)

Undecidable fragments of elementary theories ⋮ Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 ⋮ On recursively enumerable structures ⋮ 1994 Annual Meeting of the Association for Symbolic Logic ⋮ Positive equivalences ⋮ Upper Semilattices in Many-One Degrees ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Relationships Between Reducibilities ⋮ The undecidability of the Π₄-theory for the r.e. wtt and Turing degrees ⋮ Recursively enumerable sets and degrees ⋮ Low sets without subsets of higher many-one degree ⋮ On Σ¹ ₁ equivalence relations over the natural numbers ⋮ On varieties all groups of which have a property close to solvability ⋮ The problem of spectra of solvability for varieties of algebras

Cites Work

• Unnamed Item

This page was built for publication: Recursively enumerable many-one degrees