On winning strategies with unary quantifiers

DOI10.1093/logcom/6.6.779zbMath0869.03020OpenAlexW2051012354MaRDI QIDQ2785670

Juha Nurmonen

Publication date: 2 September 1997

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/18d1dc904351b11f90a0748c84916b08ebc4d4fb

zbMATH Keywords

first-order logicconnectivityEhrenfeucht-Fraïssé gamefinite graphsclasses of graphsmonadic existential second-order logictrivial graphunary generalized quantifiers

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Connectivity (05C40)

Related Items (8)

Counting quantifiers, successor relations, and logarithmic space ⋮ Solutions and query rewriting in data exchange ⋮ Game-based notions of locality over finite models ⋮ Notions of locality and their logical characterizations over finite models ⋮ Verifiable properties of database transactions ⋮ Local properties of query languages ⋮ Lower bounds for invariant queries in logics with counting. ⋮ Counting modulo quantifiers on finite structures

This page was built for publication: On winning strategies with unary quantifiers