Chains and antichains in partial orderings

DOI10.1007/S00153-008-0114-2zbMath1160.03013OpenAlexW2031861815MaRDI QIDQ1005926

Julia F. Knight, Carl G. jun. Jockusch, Valentina S. Harizanov

Publication date: 17 March 2009

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-008-0114-2

zbMATH Keywords

computable modelcomplexity of infinite chains and antichainscomputable partial orderings

Mathematics Subject Classification ID

Partial orders, general (06A06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Herrmann’s Beautiful Theorem on Computable Partial Orderings ⋮ Stability and posets

Cites Work

• Unnamed Item
• Self-embeddings of computable trees
• Computable structures and the hyperarithmetical hierarchy
• Infinite chains and antichains in computable partial Orderings
• Stability and posets
• Relatively recursive expansions
• Ramsey's theorem and recursion theory

This page was built for publication: Chains and antichains in partial orderings