Computability in Europe 2008
Logic and Theory of Algorithms
|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|