Limited Set quantifiers over Countable Linear Orderings

DOI10.1007/978-3-662-47666-6_12zbMath1443.03006OpenAlexW1049919373MaRDI QIDQ3449472

A. V. Sreejith, Thomas Colcombet

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_12

zbMATH Keywords

monadic second-order logiclinear orderingsalgebraic characterization

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Total orders (06A05) Higher-order logic (03B16)

Related Items

First-order logic and its infinitary quantifier extensions over countable words, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, First-order separation over countable ordinals, Logic and rational languages of scattered and countable series-parallel posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The monadic theory of order
• Algebraic Characterization of FO for Scattered Linear Orderings
• Regular Languages of Words over Countable Linear Orderings
• Definability and undefinability with real order at the background
• On finite monoids having only trivial subgroups
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees