Algebraic Ordinals

被引：12

作者：

Bloom, Stephen L. ^{[1
]}

Esik, Zoltan ^{[2
]}

机构：

[1] Stevens Inst Technol, Dept Comp Sci, Hoboken, NJ 07030 USA

[2] Univ Szeged, Dept Informat, Szeged, Hungary

来源：

FUNDAMENTA INFORMATICAE | 2010年 / 99卷 / 04期

关键词：

AUTOMATA; WORDS;

D O I：

10.3233/FI-2010-255

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

An algebraic tree T is one determined by a finite system of fixed point equations. The frontier Fr(T) of an algebraic tree T is linearly ordered by the lexicographic order <(l). If (Fr (T) <(l)) is well-ordered, its order type is an algebraic ordinal. We prove that the algebraic ordinals are exactly the ordinals less than omega(omega omega).

引用

页码：383 / 407

页数：25

共 30 条

[1]

[Anonymous], 1990, Introduction to modern set theory

[2]

Bloom SL, 2007, LECT NOTES COMPUT SC, V4624, P1

[3] A Mezei-Wright theorem for categorical algebras [J].

Bloom, S. L. ;

Esik, Z. .

THEORETICAL COMPUTER SCIENCE, 2010, 411 (02) :341-359

[4] Long words:: the theory of concatenation and ω-power [J].

Bloom, SL ;

Choffrut, C .

THEORETICAL COMPUTER SCIENCE, 2001, 259 (1-2) :533-548

[5]

BLOOM SL, 2004, FUNDAMENTA INFORM, V11, P1

[6]

BRAUD L, UNPUB

[7] Sequential automatic algebras [J].

Brough, Michael ;

Khoussainov, Bakhadyr ;

Nelson, Peter .

LOGIC AND THEORY OF ALGORITHMS, 2008, 5028 :84-93

[8]

Colcombet T, 2004, WORKSH AUT STRUCT LO

[9]

Courcelle B., 1978, Theoretical Computer Science, V6, P255, DOI 10.1016/0304-3975(78)90008-7

[10]

COURCELLE B, 1978, RAIRO-INF THEOR-TH C, V12, P319

← 1 2 3 →