47 citations · 159 across the 27 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 5 cited
Recognisable languages over monads
Mikołaj Bojańczyk
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To…
cs.LO2015
The MSO+U theory of (N, <) is undecidable
Mikołaj Bojańczyk, Paweł Parys, Szymon Toruńczyk
We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets ho…