Infinite chains and antichains in computable partial orderings

We show that every infinite computable partial ordering has either an infinite Delta (0)(2) chain or an infinite Pi (0)(2) antichain. Our main result is that this cannot be improved: We construct an infinite computable partial ordering that has neither an infinite Delta (0)(2) chain nor an infinite Delta (0)(2) antichain.