Positive presentations of families relative to \(e\)-oracles

DOI10.1134/S0037446618040079zbMath1469.03123OpenAlexW2889607482MaRDI QIDQ1617982

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

Publication date: 13 November 2018

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

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

zbMATH Keywords

enumerationcomputable numberingcomputable setcomputably enumerable setpositive numbering\(e\)-reducibilitydecidable numbering

Mathematics Subject Classification ID

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

Related Items (4)

Positive numberings in admissible sets ⋮ Computable positive and Friedberg numberings in hyperarithmetic ⋮ Semidecidable numberings in admissible sets ⋮ Partial decidable presentations in hyperarithmetic

Cites Work

• Ideals without minimal elements in Rogers semilattices
• Positive enumerations
• Universal generalized computable numberings and hyperimmunity
• Generalized computable universal numberings
• Minimal generalized computable enumerations and high degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive presentations of families relative to \(e\)-oracles