We give an exposition of Herrmann’s proof that there is an infinite computable partial ordering with no infinite Σ02chains or antichains.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.