1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LO2026
Generalised Quantifiers Based on Rabin-Mostowski Index
Denis Kuperberg, Damian Niwiński, Paweł Parys +1
In this work we introduce new generalised quantifiers which allow us to express the Rabin-Mostowski index of automata. Our main results study expressive power and decidability of t…
cs.LO2025
A Dichotomy Theorem for Ordinal Ranks in MSO
Damian Niwiński, Paweł Parys, Michał Skrzypczak
We focus on formulae of monadic second-order logic over the full binary tree, such that the witness is a well-founded set. The ordinal rank $\mathr…
cs.LO2023★ 1 cited
On the Computability of Measures of Regular Sets of Infinite Trees
Damian Niwiński, Paweł Parys, Michał Skrzypczak
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this p…