Almost semirecursive sets

DOI10.1007/BF02674870MaRDI QIDQ1972518zbMATH OpenOpenAlexFDO

Authors A. N. Degtev

Publication date 2 August 2000

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

almost semirecursive setsrecursive enumerabilitysimple set

Mathematics Subject Classification ID

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

Review text

The notion of almost semirecursive sets is introduced. It is proved that: (i) If \(A\) and \(\overline{A}\) are almost semirecursive sets, then \(A\) is a semirecursive set. (ii) There exists a wsr*-set which is neither a wsr nor an almost semirecursive set.

Recommendations

• Weakly semirecursive sets
• On semialgebraic sets and its recursiveness
• Semirecursive Sets and Positive Reducibility
• scientific article; zbMATH DE number 1254388
• scientific article; zbMATH DE number 3925245
• scientific article; zbMATH DE number 10789
• Semiregular large sets
• scientific article; zbMATH DE number 1500533
• Semiring of sets
• A note on recurrent sets

Cites work

• Recursively Enumerable Sets and Retracing Functions
• Semirecursive Sets and Positive Reducibility
• Weakly semirecursive sets
• Weakly semirecursive sets and r.e. orderings

Cited in

(6)

• Weakly semirecursive sets and r.e. orderings
• Semiregular large sets
• Weakly semirecursive sets
• A variant of the Notion of Semicreative set
• Effective Nonrecursiveness
• Birecurrent sets

This page was built for publication: Almost semirecursive sets

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