First-order separation over countable ordinals

DOI10.1007/978-3-030-99253-8_14arXiv2201.03089MaRDI QIDQ6181932

No author found.

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.03089

zbMATH Keywords

first-order logicmonadic second-order logicseparationregular languagespointlike setscountable ordinals

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

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
• Schützenberger and Eilenberg theorems for words on linear orderings
• Algorithmic uses of the Feferman-Vaught theorem
• The monadic theory of order
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Finite automata and ordinals
• Logic over words on denumerable ordinals
• Pointlike sets: the finest aperiodic cover of a finite semigroup
• First-order logic and its infinitary quantifier extensions over countable words
• Pointlike sets for varieties determined by groups
• Separating Regular Languages with First-Order Logic
• Algebraic Characterization of FO for Scattered Linear Orderings
• Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Limited Set quantifiers over Countable Linear Orderings
• Recognisable Languages over Monads
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• The pseudovariety $J$ is hyperdecidable
• Two-Variable Logic over Countable Linear Orderings
• AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
• Going Higher in First-Order Quantifier Alternation Hierarchies on Words
• On finite monoids having only trivial subgroups
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: First-order separation over countable ordinals