Logic in Computer Science, Symposium on (2000)
Santa Barbara, California
June 26, 2000 to June 29, 2000
Steven Lindell , Haverford College
Scott Weinstein , University of Athens and University of Pennsylvania
We establish that the decidability of the first order theory of a class of finite structures C is a simple and useful condition for guaranteeing that the expressive power of FO + LFP properly extends that of FO on C, unifying separation results for various classes of structures that have been studied. We then apply this result to show that it encompasses certain constructive pebble game techniques which are widely used to establish separations between FO and FO + LFP, and demonstrate that these same techniques cannot succeed in performing separations from any complexity class that contains DLOGTIME.
Descriptive Complexity Theory, Finite Model Theory
S. Lindell and S. Weinstein, "The Role of Decidability in First Order Separations over Classes of Finite Structures," Logic in Computer Science, Symposium on(LICS), Santa Barbara, California, 2000, pp. 45.