Partial decidable presentations in hyperarithmetic

DOI10.1134/S0037446619030091zbMath1481.03036OpenAlexW2952286598WikidataQ127702496 ScholiaQ127702496MaRDI QIDQ2332068

V. G. Puzarenko, M. Kh. Fajzrakhmanov, Iskander Sh. Kalimullin

Publication date: 1 November 2019

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

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

zbMATH Keywords

computable numberingnumberingcomputable setcomputably enumerable setpositive numberinghyperarithmetic set\(e\)-reducibilitydecidable numberingconstructible admissible set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (2)

Positive numberings in admissible sets ⋮ Computable positive and Friedberg numberings in hyperarithmetic

Cites Work

• Positive presentations of families relative to \(e\)-oracles
• Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
• Recursion, metarecursion, and inclusion
• The Meta-R.E. sets, but not the Π₁¹ sets, can be enumerated without repetition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial decidable presentations in hyperarithmetic