Covering of ordinals

Braud, Laurent

doi:10.4230/LIPIcs.FSTTCS.2009.2310

Document

Covering of ordinals

Author Laurent Braud

Part of: Volume: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2009-12-14

PDF

File

PDF

LIPIcs.FSTTCS.2009.2310.pdf

Filesize: 147 kB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2009.2310
URN: urn:nbn:de:0030-drops-23108

Subject Classification

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

0

Metadata Views

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.

Cite As Get 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

Author Details

Laurent Braud

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail