Partial Decidable Presentations in Hyperarithmetic

I. Sh Kalimullin, V. G. Puzarenko, M. Kh Faizrahmanov

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


We study the problem of the existence of decidable and positive Π11- and Σ11-numberings of the families of Π11- and Σ11-cones with respect to inclusion. Some laws are found that reflect the presence of decidable computable Π11- and Σ11-numberings of these families in dependence on the analytical complexity of the set defining a cone.

Original languageEnglish
Pages (from-to)464-471
Number of pages8
JournalSiberian Mathematical Journal
Issue number3
Publication statusPublished - 1 May 2019


  • computable numbering
  • computable set
  • computably enumerable set
  • constructible admissible set
  • decidable numbering
  • e-reducibility
  • hyperarithmetic set
  • numbering
  • positive numbering


Dive into the research topics of 'Partial Decidable Presentations in Hyperarithmetic'. Together they form a unique fingerprint.

Cite this