Limited Set quantifiers over Countable Linear Orderings

Thomas Colcombet,A V Sreejith

doi:10.1007/978-3-662-47666-6_12

Limited Set quantifiers over Countable Linear Orderings

Thomas Colcombet, A V Sreejith

https://doi.org/10.1007/978-3-662-47666-6_12

Copy DOI

Publication Date: Jan 1, 2015

Citations: 17

Affiliation: Laboratoire d'Informatique Algorithmique: Fondements et Applications, Université Paris Cité

#Weak Monadic Second-order Logic #Countable Linear Orderings + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

AbstractIn 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.KeywordsLinear orderingsAlgebraic characterizationMonadic second order logic

Full Text