Logical Approaches to Computational Barriers

Subrecursive complexity of identifying the Ramsey structure of posets

Speaker:
| Willem Fouche |

Slot: |
Array, 11:00-11:20, col. 4 |

We show that finite ordinal sums of antichains are Ramsey objects in the category of finite posets aand height-preserving embeddings. Our proof yields a primitive recursive algorithm for constructing the finite posets which contain the required homogeneities.

websites: Arnold Beckmann | 2008-05-18 |