Positive numberings in admissible sets

DOI10.1134/S003744662003009XzbMath1481.03038OpenAlexW3034422115MaRDI QIDQ2191379

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

Publication date: 24 June 2020

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

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

zbMATH Keywords

admissible setcomputable numberingnumberingcomputable setcomputably enumerable setnegative numberingpositive numberingdecidable numbering

Mathematics Subject Classification ID

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

Related Items (1)

Semidecidable numberings in admissible sets

Cites Work

• A semilattice of numberings. II
• Positive presentations of families relative to \(e\)-oracles
• Partial decidable presentations in hyperarithmetic
• Generalized computable universal numberings
• On a semilattice of numberings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive numberings in admissible sets