Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Subrecursive complexity of identifying the Ramsey structure of posets

Edit abstract data

Speaker: Willem Fouche
Slot: Mon, 11:00-11:20, Vice-Rector (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 Valid HTML 4.01! Valid CSS!