Locality of order-invariant first-order formulas

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Conference object 01 Jan 1998 Germany Publisher:Springer Berlin HeidelbergJournal:ACM Transactions on Computational Logic, volume 1, pages 112-130 (issn: 1529-3785, eissn: 1557-945X,

Copyright policy )

Authors: Grohe, Martin; Schwentick, Thomas;

doi: 10.1007/bfb0055793 , 10.1145/343369.343386

Locality of order-invariant first-order formulas

- Summary
- Subjects
- Metrics

Abstract

A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.

Country

Germany

Related Organizations

University of Freiburg
Germany
Johannes Gutenberg University of Mainz
Germany

Keywords

locality, logics, Database theory, Model theory of finite structures, ordered structures, Classical first-order logic, first-order logic

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	28
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average