Finite presentation of homogeneous graphs, posets and Ramsey classes (Q814132)

The paper first describes a classification programme for Ramsey classes relating Ramsey classes and homogeneous structures. This approach can be used, among others, to characterize Ramsey classes of graphs, tournaments, and partially ordered sets. The main result of the paper is a finite presentation of the generic (i.e., homogeneous and universal) partially ordered set. This is achieved by first giving a recursive definition which is then modified to a finite presentation of a partially ordered set which is isomorphic to the generic partially ordered set. The relation of this result to Conway's surreal numbers is discussed. Moreover, it is shown that directed and undirected graphs, tournaments and partially ordered sets are finitely presented.