Khutoretskii's theorem for generalized computable families

DOI10.1007/S10469-019-09557-9zbMATH Open1443.03024OpenAlexW2986679811MaRDI QIDQ2300906FDOQ2300906

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• Universal generalized computable numberings and hyperimmunity
• On the limit property of the greatest element in the Rogers semilattice
• The Rogers semilattices of generalized computable enumerations
• Title not available (Why is that?)

Cited In (11)

• 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
• Universal generalized computable numberings and hyperimmunity
• Computability and numberings
• Extremal numberings and fixed point theorems
• Minimal generalized computable enumerations and high degrees
• Bounded reducibility for computable numberings
• Dichotomy theorems for families of non-cofinal essential complexity
• Weak reducibility of computable and generalized computable numberings
• On Non-principal Arithmetical Numberings and Families
• Some properties of precompletely and positively numbered sets

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)