Positive presentations of families in relation to reducibility with respect to enumerability

DOI10.1007/s10469-018-9503-8zbMath1485.03176OpenAlexW2901340470MaRDI QIDQ1731525

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

Publication date: 13 March 2019

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-018-9503-8

Mathematics Subject Classification ID

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

Related Items (1)

Computable positive and Friedberg numberings in hyperarithmetic

Cites Work

• Positive enumerations
• The Meta-R.E. sets, but not the Π₁¹ sets, can be enumerated without repetition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive presentations of families in relation to reducibility with respect to enumerability