Infinite chains and antichains in computable partial Orderings
From MaRDI portal
Publication:2747728
DOI10.2307/2695053zbMath1018.03038OpenAlexW2097686156MaRDI QIDQ2747728
No author found.
Publication date: 5 September 2003
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695053
Related Items (5)
An inside/outside Ramsey theorem and recursion theory ⋮ Herrmann’s Beautiful Theorem on Computable Partial Orderings ⋮ Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 ⋮ Chains and antichains in partial orderings ⋮ The atomic model theorem and type omitting
Cites Work
This page was built for publication: Infinite chains and antichains in computable partial Orderings
