On winning strategies with unary quantifiers
Open Access
- 1 December 1996
- journal article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 6 (6) , 779-798
- https://doi.org/10.1093/logcom/6.6.779
Abstract
A combinatorial argument for two finite structures to agree on all sentences with bounded quantifier rank in first-order logic with any set of unary generalized quantifiers is given. It is known that connectivity of finite structures is neither in monadic Σ11 nor in ≲ww (Qu), where Qu is the set of all unary generalized quantifiers. Using this combinatorial argument and a combination of second-order Ehrenfeucht-Fraïssé games developed by Ajtai and Fagin, we prove that connectivity of finite structures is not in monadic σ11 with any set of unary quantifiers even if sentences are allowed to contain built-in relations of moderate degree. The combinatorial argument is also used to show that no class (if it is not in some sense trivial) of finite graphs defined by forbidden minors is in ≲ww(Qu). In particular, the class of planar graphs is not in ≲ww(Qu)Keywords
This publication has 0 references indexed in Scilit: