Recursively enumerable many-one degrees

DOI10.1007/BF02218612MaRDI QIDQ1845719zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(15)

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

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

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