• A polychromatic Ramsey theory for ordinals

      Huschenbett, M; Liu, J (Springer Berlin Heidelberg, 2013)
      The Ramsey degree of an ordinal α is the least number n such that any colouring of the edges of the complete graph on α using finitely many colours contains an n-chromatic clique of order type α. The Ramsey degree exists ...
    • Tree-automatic well-founded trees

      Liu, J; Kartzow, A; Lohrey, M; Huschenbett, M (International Federation of Computational Logic, 2013)
      We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. ...