Kurz gefasst
Fachartikel in der Zeitschrift Computability, 2012. Verfasst von Peter A. Cholak und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref).
Abstract (Originalsprache)
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for such orders, and show that the former is strictly stronger than the latter. We then show that every $\emptyset'$ -computable structure (or even just of c.e. degree) has the same degree spectrum as some computably enumerable (co-c.e.) partial order, and hence that there is a c.e. (co-c.e.) partial order with spectrum equal to the set of nonzero degrees.
Zitieren
APA
Cholak, P. A., Dzhafarov, D. D., Schweber, N., & Shore, R. A. (2012). Computably Enumerable Partial Orders. Computability. https://doi.org/10.3233/com-12013
Vancouver
Cholak PA, Dzhafarov DD, Schweber N, Shore RA. Computably Enumerable Partial Orders. Computability. 2012. doi:10.3233/com-12013
BibTeX
@article{Cholak2012,
author = {Cholak, Peter A. and Dzhafarov, Damir D. and Schweber, Noah and Shore, Richard A.},
title = {Computably Enumerable Partial Orders},
journal = {Computability},
year = {2012},
doi = {10.3233/com-12013}
}
EUVIMED