The Role of Decidability in First Order Separations over Classes of Finite Structures

Authors:
Steven Lindell;Scott Weinstein
Affiliations:
-;-
Venue:
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Year:
2000

Citing 8
Cited 0

Relational queries computable in polynomial time

Information and Control
On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
An analysis of fixed-point queries on binary trees

Theoretical Computer Science
On a monadic NP vs monadic co-NP

Information and Computation
First Order Logic, Fixed Point Logic and Linear Order

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.