@inproceedings{10.1007/978-3-662-47666-6_12,
Abstract = {In this paper, we study several sublogics of monadic second-order logic over countable linear orderings, such as first-order logic, first-order logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic second-order logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these logics and compare their respective expressive power.},
Address = {Berlin, Heidelberg},
Author = {Colcombet, Thomas and Sreejith, A. V.},
BookTitle = {Automata, Languages, and Programming},
Editor = {Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina},
File = {Limited Set quantifiers over Countable Linear Orderings - Colcombet-Sreejith2015\_Chapter\_LimitedSetQuantifiersOverCount - a - c.pdf},
ISBN = {978-3-662-47666-6},
Pages = {146--158},
Publisher = {Springer Berlin Heidelberg},
Title = {Limited Set quantifiers over Countable Linear Orderings},
Year = {2015},
date-added = {2020-05-20 18:03:51 +0200},
date-modified = {2020-05-20 18:03:51 +0200},
doi = {10.1007/978-3-662-47666-6_12}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A