Khutoretskii's theorem for generalized computable families

DOI10.1007/S10469-019-09557-9MaRDI QIDQ2300906zbMATHOpenAlexFDO

Authors M. Kh. Faizrakhmanov

Publication date 28 February 2020

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

Full work available at URL https://doi.org/10.1007/s10469-019-09557-9

zbMATH Keywords

numberinghyperarithmetic setsgeneralized computable numberingRogers semilatticescomputable ordinalgeneralized computable familyKhutoretskii's theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Recommendations

• A decomposition of the Rogers semilattice of a family of d.c.e. sets
• Universal generalized computable numberings and hyperimmunity
• Bounded reducibility for computable numberings
• Computability and numberings
• Some absolute properties of \(A\)-computable numberings

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1873436 (Why is no real title available?)
• Classical recursion theory. The theory of functions and sets of natural numbers
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Generalized computable numerations and nontrivial Rogers semilattices
• Generalized computable universal numberings
• On the cardinality of the upper semilattice of computable enumerations
• On the limit property of the greatest element in the Rogers semilattice
• The Rogers semilattices of generalized computable enumerations
• Universal generalized computable numberings and hyperimmunity

Cited in

(11)

• Computability and numberings
• Extremal numberings and fixed point theorems
• Universal generalized computable numberings and hyperimmunity
• Some properties of precompletely and positively numbered sets
• On Non-principal Arithmetical Numberings and Families
• Bounded reducibility for computable numberings
• On the embedding of the first nonconstructive ordinal in the Rogers semilattices
• Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
• Minimal generalized computable enumerations and high degrees
• Dichotomy theorems for families of non-cofinal essential complexity
• Weak reducibility of computable and generalized computable numberings

This page was built for publication: Khutoretskii's theorem for generalized computable families

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