Computably Enumerable Partial Orders
From MaRDI portal
Publication:4904461
DOI10.3233/COM-12013zbMath1277.03039arXiv1110.4068OpenAlexW1524267671MaRDI QIDQ4904461
Noah Schweber, Richard A. Shore, Damir D. Dzhafarov, Peter A. Cholak
Publication date: 30 January 2013
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.4068
Foundations of classical theories (including reverse mathematics) (03B30) Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57)
Related Items
A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On degree spectra of topological spaces