Monadic second order logic over countable linear orderings

Speaker(s)

A V Sreejith

Affiliation

Uniwersytet Warszawski

Date

Oct. 19, 2016, 2:15 p.m.

Room

room 5870

Seminar

Seminar Automata Theory

---

We will look at words over countable linear orderings (for example, omega words, words over rationals etc). We will then look at languages over such words definable by MSO[<]. Is satisfiability of MSO decidable? Is WMSO (weak MSO) as powerful as MSO? All these questions can be answered by algebra. Finally we will take a look at circle algebra, some known results, and many unknown problems.

---