Sciweavers

3 search results - page 1 / 1
» Shrinking games and local formulas
Sort
View
APAL
2004
73views more  APAL 2004»
13 years 4 months ago
Shrinking games and local formulas
Gaifman's normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of "scattered local sentences", whe...
H. Jerome Keisler, Wafik Boulos Lotfallah
CSL
2004
Springer
13 years 10 months ago
Game-Based Notions of Locality Over Finite Models
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
13 years 11 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer