Minimal generalized computable enumerations and high degrees

DOI10.1134/S0037446617030181zbMath1420.03106OpenAlexW2721444575MaRDI QIDQ2400746

M. Kh. Fajzrakhmanov

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

high setgeneralized computable enumerationminimal enumeration\(\mathrm{Low}_2\) setarithmetic enumeration

Mathematics Subject Classification ID

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

Related Items (11)

On \(p \)-universal and \(p \)-minimal numberings ⋮ Positive presentations of families relative to \(e\)-oracles ⋮ Minimal generalized computable enumerations and high degrees ⋮ 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 ⋮ The Rogers semilattices of generalized computable enumerations ⋮ On Non-principal Arithmetical Numberings and Families ⋮ Weak reducibility of computable and generalized computable numberings

Cites Work

• Minimal generalized computable enumerations and high degrees
• Elementary Theories for Rogers Semilattices
• Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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