2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Mikołaj Bojańczyk
This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite…