Logic over words on denumerable ordinals
From MaRDI portal
Publication:1604197
DOI10.1006/jcss.2001.1782zbMath1006.68072MaRDI QIDQ1604197
Publication date: 4 July 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/34716c3aaa8830d7062458d7b3f7dbcf80aabda7
68Q45: Formal languages and automata
Related Items
A hierarchy of tree-automatic structures, Schützenberger and Eilenberg theorems for words on linear orderings, Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\), Logic and rational languages of words indexed by linear orderings, Star-free sets of words on ordinals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the expressive power of temporal logic for infinite words
- A syntactic congruence for rational \(\omega\)-languages
- First-order logic and star-free sets
- Star-free sets of words on ordinals
- On the expressive power of temporal logic
- An application of games to the completeness problem for formalized theories
- Weak Second‐Order Arithmetic and Finite Automata
- Application of model theoretic games to discrete linear orders and finite automata
- Star-free regular sets of ω-sequences
- Automata, Semigroups and Recognizability of Words on Ordinals
- On finite monoids having only trivial subgroups
- $ℵ_0$-categoricity of linear orderings
- Decision methods in the theory of ordinals
