Minimal generalized computable enumerations and high degrees

DOI10.1134/S0037446617030181MaRDI QIDQ2400746zbMATH OpenOpenAlexFDO

Authors Marat Kh. Faizrahmanov

Publication date 30 August 2017

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0037446617030181

zbMATH Keywords

\(\mathrm{Low}_2\) setarithmetic enumerationgeneralized computable enumerationhigh setminimal enumeration

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Recommendations

• The Rogers semilattices of generalized computable enumerations
• High Minimal Pairs in the Enumeration Degrees
• Jumps of quasi-minimal enumeration degrees
• Constructing minimal pairs of degrees
• Khutoretskii's theorem for generalized computable families

Cites work

• Elementary Theories for Rogers Semilattices
• Generalized computable numerations and nontrivial Rogers semilattices
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1746561 (Why is no real title available?)
• scientific article; zbMATH DE number 1873436 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Minimal generalized computable enumerations and high degrees

Cited in

(18)

• Positive presentations of families relative to e-oracles
• Universal generalized computable numberings and hyperimmunity
• The Rogers semilattices of generalized computable enumerations
• Weak reducibility of computable and generalized computable numberings
• Highness properties close to PA completeness
• On \(p \)-universal and \(p \)-minimal numberings
• Minimal generalized computable enumerations and high degrees
• High Minimal Pairs in the Enumeration Degrees
• Bounding minimal degrees by computably enumerable degrees
• Algebraic aspects of the computably enumerable degrees.
• A MINIMAL SET LOW FOR SPEED
• Two theorems on minimal generalized computable numberings
• Effectively infinite classes of numberings of computable families of reals
• Extremal numberings and fixed point theorems
• On the embedding of the first nonconstructive ordinal in the Rogers semilattices
• A family with a single minimal but not least numbering
• On Non-principal Arithmetical Numberings and Families
• Notes on classes of minimal numberings of arithmetical set families

This page was built for publication: Minimal generalized computable enumerations and high degrees

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