Skip to main content
Journal Article

Herrmann’s beautiful theorem on computable partial orderings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10010 127-133
DOI: 10.1007/978-3-319-50062-1_10
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give an exposition of Herrmann’s proof that there is an infinite computable partial ordering with no infinite Σ02chains or antichains.

Author supplied keywords

Cite

CITATION STYLE

APA

Jockusch, C. G. (2017). Herrmann’s beautiful theorem on computable partial orderings. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10010, 127–133. https://doi.org/10.1007/978-3-319-50062-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free