A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Shrinking games and local formulas*1
2004
Annals of Pure and Applied Logic
Gaifman's normal form theorem showed that every ÿrst-order sentence of quantiÿer rank n is equivalent to a Boolean combination of "scattered local sentences", where the local neighborhoods have radius at most 7 n−1 . This bound was improved by Lifsches and Shelah to 3 × 4 n−1 . We use Ehrenfeucht-Fra ssà e type games with a "shrinking horizon" to get a spectrum of normal form theorems of the Gaifman type, depending on the rate of shrinking. This spectrum includes the result of Lifsches and
doi:10.1016/s0168-0072(04)00002-8
fatcat:ddzl6xajyneevczewps2slxdry