Covering of ordinals

Author Laurent Braud



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2009.2310.pdf
  • Filesize: 147 kB
  • 12 pages

Document Identifiers

Author Details

Laurent Braud

Cite AsGet BibTex

Laurent Braud. Covering of ordinals. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 97-108, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2310

Abstract

The paper focuses on the structure of fundamental sequences of ordinals smaller than $\e$. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for ordinals themselves. The structures are precisely classified in the pushdown hierarchy. Ordinals are also located in the hierarchy, and a direct presentation is given.
Keywords
  • Ordinal theory
  • pushdown hierarchy
  • fundamental sequence
  • monadic second-order logic
  • prefix-recognizable graphs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads