Infinite chains and antichains in computable partial Orderings
AbstractWe show that every infinite computable partial ordering has either an infinite chain or an infinite antichain. Our main result is that this cannot be improved: We construct an infinite computable partial ordering that has neither an infinite chain nor an infinite antichain.
1968 ◽
Vol 20
◽
pp. 535-554
◽
2002 ◽
Vol 16
(1)
◽
pp. 129-137
◽
1998 ◽
Vol 35
(1)
◽
pp. 221-228
◽
Keyword(s):
1992 ◽
Vol 24
(03)
◽
pp. 604-634
◽
Keyword(s):
Keyword(s):
Keyword(s):
1990 ◽
Vol 27
(03)
◽
pp. 720-725
◽
Keyword(s):
1994 ◽
Vol 31
(04)
◽
pp. 991-1003
◽
Keyword(s):