Work

Definability with bounded number of bound variables

Year: 1989
Type: article
Abstract: A theory satisfies the k-variable property if every first-order formula is equivalent to a formula with at most k bound variables (possibly reused). Gabbay has shown that a model of temporal logic satisfies the k-variable property for some k if and only if there exists a finite basis for the temporal connectives over that model. We give a model-theoretic method for establishing the k-variable property, involving a restricted Ehrenfeucht-Fraisse game in which each player has only k pebbles. We use the method to unify and simplify results in the literature for linear orders. We also establish new k-variable properties for various theories of bounded-degree trees, and in each case obtain tight upper and lower bounds on k. This gives the first finite basis theorems for branching-time models of temporal logic. 1 Introduction A first-order theory \\Sigma satisfies the k-variable property if every first-order formula is equivalent under \\Sigma to a formula with at most k bound variables (pos...
Language: English
Open Access status: hybrid
Estimated APC paid: $2,840
OpenAlex ID: W255293104
FWCI: 3.667
Cites: 13
Cited by: 143
Related to: 10