Successor-invariance in the finite

A first-order sentence /spl theta/ of vocabulary /spl sigma/ /spl cup/ {S} is successor-invariant in the finite if for every finite /spl sigma/-structure M and successor relations S/sub 1/ and S/sub 2/ on M, (M, S/sub 1/) /spl vDash/ /spl theta/ /spl hArr/ (M, S/sub 2/) /spl vDash/ /spl theta/. In this paper I give an example of a non-first-order definable class of finite structures, which is, however, defined by a successor-invariant first-order sentence. This strengthens a corresponding result for order-invariant in the finite, due to Y. Gurevich.

[1]  Andreas Blass,et al.  The Logic of Choice , 2000, Journal of Symbolic Logic.

[2]  Y. Gurevich On Finite Model Theory , 1990 .

[3]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[4]  Martin Otto,et al.  Epsilon-logic is more expressive than first-order logic over finite structures , 2000, Journal of Symbolic Logic.

[5]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.