Arrow Research search
Back to CSL

CSL 2001

An Existential Locality Theorem

Conference Paper Descriptive Complexity Logic in Computer Science · Theoretical Computer Science

Abstract

Abstract We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Annual Conference on Computer Science Logic
Archive span
1988-2026
Indexed papers
1413
Paper id
306233359358788606