Herrmann’s Beautiful Theorem on Computable Partial Orderings

DOI10.1007/978-3-319-50062-1_10zbMath1471.03069OpenAlexW2557855696MaRDI QIDQ2970954

Carl G. jun. Jockusch

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_10

zbMATH Keywords

chainsantichainscomputable partial orderings

Mathematics Subject Classification ID

Partial orders, general (06A06) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Chains and antichains in partial orderings
• Infinite chains and antichains in computable partial Orderings
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Stability and posets
• Ramsey's theorem and recursion theory

This page was built for publication: Herrmann’s Beautiful Theorem on Computable Partial Orderings