Logic over words on denumerable ordinals
type: Item
instance of: scholarly article
title: Logic over words on denumerable ordinals
zbMATH Open document ID: 1006.68072
author: Nicolas Bedon
published in: Journal of Computer and System Sciences
publication date: 2002-07-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1763388
zbMATH Keywords: star-free sets
zbMATH Keywords: finite words
MaRDI profile type: Publication
OpenAlex ID: W2032475218
cites work: Q4848740
cites work: A syntactic congruence for rational \(\omega\)-languages
cites work: Q3838998
cites work: Star-free sets of words on ordinals
cites work: Automata, Semigroups and Recognizability of Words on Ordinals
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q5525343
cites work: Q5608007
cites work: Decision methods in the theory of ordinals
cites work: On the expressive power of temporal logic for infinite words
cites work: On the expressive power of temporal logic
cites work: An application of games to the completeness problem for formalized theories
cites work: Application of model theoretic games to discrete linear orders and finite automata
cites work: Q5641083
cites work: Q3752578
cites work: Q3728249
cites work: Q3698327
cites work: Q4385527
cites work: Q3776657
cites work: First-order logic and star-free sets
cites work: $ℵ_0$-categoricity of linear orderings
cites work: On finite monoids having only trivial subgroups
cites work: Q4302435
cites work: Star-free regular sets of ω-sequences
cites work: Q4036596
cites work: Q3216154
cites work: Q3691083
DOI: 10.1006/JCSS.2001.1782
description: scientific article; zbMATH DE number 1763388