Computably Enumerable Partial Orders
From MaRDI portal
Publication:4904461
DOI10.3233/COM-12013zbMath1277.03039arXiv1110.4068MaRDI 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
03B30: Foundations of classical theories (including reverse mathematics)
03D25: Recursively (computably) enumerable sets and degrees
03C57: Computable structure theory, computable model theory
Related Items
A computably enumerable partial ordering without computably enumerable maximal chains and antichains