Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I

DOI10.1007/BF01673573zbMath0436.03040MaRDI QIDQ1140636

S. D. Denisov

Publication date: 1979

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

zbMATH Keywords

upper semilattice of recursively enumerable m-degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (5)

The structure of the honest polynomial m-degrees ⋮ Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 ⋮ Upper Semilattices in Many-One Degrees ⋮ Computably enumerable sets and related issues ⋮ On Σ¹ ₁ equivalence relations over the natural numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computable enumerations of families of general recursive functions
• On the Cartesian subalgebras of a free Lie sum of Lie algebras
• Initial Segments of Many-One Degrees
• A note on universal sets
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets

This page was built for publication: Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I