1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Damian Niwiński, Paweł Parys, Michał Skrzypczak
We focus on formulae ∃X.φ(Y,X) of monadic second-order logic over the full binary tree, such that the witness X is a well-founded set. The ordinal rank $\mathr…