Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

JSYML

2007

2007

We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every inﬁnite linear order has either an inﬁnite descending sequence or an inﬁnite ascending sequence, and CAC (ChainAntiChain), which states that every inﬁnite partial order has either an inﬁnite chain or an inﬁnite antichain. It is well-known that Ramsey’s Theorem for pairs (RT2 2) splits into a stable version (SRT2 2) and a cohesive principle (COH). We show that the same is true of ADS and CAC, and that in their cases these versions are strictly weaker (which is not known to be the case for RT2 2 and SRT2 2). We also analyze the relationships between these principles and other systems and principles previously studied by reverse mathematics, such as WKL0, DNR, and BΣ2, showing for instance that WKL0 is ...

Added |
16 Dec 2010 |

Updated |
16 Dec 2010 |

Type |
Journal |

Year |
2007 |

Where |
JSYML |

Authors |
Denis R. Hirschfeldt, Richard A. Shore |

Comments (0)