Weakly semirecursive sets and r.e. orderings

DOI10.1016/0168-0072(93)90040-KzbMath0767.03023OpenAlexW1986438122WikidataQ126772957 ScholiaQ126772957MaRDI QIDQ1210140

Frank Stephan, Martin Kummer

Publication date: 16 May 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90040-k

zbMATH Keywords

initial segmentr.e. partial orderingsweakly semirecursive sets

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Lower semilattices of separable congruences of numbered algebras ⋮ Almost semirecursive sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical recursion theory. Vol. II
• Terse, superterse, and verbose sets
• Hypersimple sets with retraceable complements
• Effective extensions of partial orders
• R. e. presented linear orders
• Weakly semirecursive sets
• Linear Order Types of Nonrecursive Presentability
• Two-dimensional partial orderings: Recursive model theory
• Semirecursive Sets and Positive Reducibility
• The Degrees of Hyperimmune Sets

This page was built for publication: Weakly semirecursive sets and r.e. orderings