Algebraic linear orderings

S. L. Bloom, Z. Ésik

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than ωω. It follows that the algebraic ordinals are exactly those less than ωωω.

Original languageEnglish
Pages (from-to)491-515
Number of pages25
JournalInternational Journal of Foundations of Computer Science
Volume22
Issue number2
DOIs
Publication statusPublished - Feb 2011

Fingerprint

Context free languages
Algebra

Keywords

  • context-free linear and well-orderings
  • fixed point equations
  • Linear orderings

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Algebraic linear orderings. / Bloom, S. L.; Ésik, Z.

In: International Journal of Foundations of Computer Science, Vol. 22, No. 2, 02.2011, p. 491-515.

Research output: Contribution to journalArticle

@article{2a884cc6c3f04b81a548aeb916764120,
title = "Algebraic linear orderings",
abstract = "An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than ωω. It follows that the algebraic ordinals are exactly those less than ωωω.",
keywords = "context-free linear and well-orderings, fixed point equations, Linear orderings",
author = "Bloom, {S. L.} and Z. {\'E}sik",
year = "2011",
month = "2",
doi = "10.1142/S0129054111008155",
language = "English",
volume = "22",
pages = "491--515",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

TY - JOUR

T1 - Algebraic linear orderings

AU - Bloom, S. L.

AU - Ésik, Z.

PY - 2011/2

Y1 - 2011/2

N2 - An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than ωω. It follows that the algebraic ordinals are exactly those less than ωωω.

AB - An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than ωω. It follows that the algebraic ordinals are exactly those less than ωωω.

KW - context-free linear and well-orderings

KW - fixed point equations

KW - Linear orderings

UR - http://www.scopus.com/inward/record.url?scp=78650307134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650307134&partnerID=8YFLogxK

U2 - 10.1142/S0129054111008155

DO - 10.1142/S0129054111008155

M3 - Article

VL - 22

SP - 491

EP - 515

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 2

ER -