Limited set quantifiers over countable linear orderings
From MaRDI portal
Publication:3449472
DOI10.1007/978-3-662-47666-6_12zbMATH Open1443.03006OpenAlexW1049919373MaRDI QIDQ3449472FDOQ3449472
Authors: Thomas Colcombet, A. V. Sreejith
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
Recommendations
Higher-order logic (03B16) Decidability of theories and sets of sentences (03B25) Total orders (06A05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On finite monoids having only trivial subgroups
- Title not available (Why is that?)
- Testing and generating infinite sequences by a finite automaton
- The monadic theory of order
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Definability and undefinability with real order at the background
- Regular languages of words over countable linear orderings
- Algebraic characterization of FO for scattered linear orderings
Cited In (6)
- Monadic theory of a linear order versus the theory of its subsets with the lifted min/max operations
- Definability in Rationals with Real Order in the Background
- Title not available (Why is that?)
- First-order logic and its infinitary quantifier extensions over countable words
- First-order separation over countable ordinals
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
This page was built for publication: Limited set quantifiers over countable linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449472)