Arrow Research search
Back to Highlights

Highlights 2015

Limited set quantifiers over countable linear orderings

Conference Abstract Highlights presentation Logic in Computer Science ยท Theoretical Computer Science

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-ordered 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. 11: 20 11: 30 Break

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
1053913079989456381
v2026.09.13