Effectively infinite classes of numberings of computable families of reals

DOI10.3103/s1066369x23050031MaRDI QIDQ6086824

M. Kh. Fajzrakhmanov

Publication date: 10 November 2023

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

computable numberingpositive numberingeffective infinityleft-c.e. realsingle-valued numbering

Mathematics Subject Classification ID

Theory of computing (68Qxx) Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx)

Related Items

Effectively infinite classes of numberings and computable families of reals

Cites Work

• An easy priority-free proof of a theorem of Friedberg
• Some effectively infinite classes of enumerations
• Positive enumerations
• Limitwise monotonic spectra and their generalizations
• Minimal generalized computable enumerations and high degrees
• Turing Computability
• Elementary Theories for Rogers Semilattices
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Numberings and Randomness
• Limitwise monotonic sets of reals
• Creative sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item