NDLI: On the forms of locality over finite models

Content Provider	IEEE Xplore Digital Library
Author	Libkin, L.
Copyright Year	1997
Description	Author affiliation: Bell Labs., Murray Hill, NJ, USA (Libkin, L.)
Abstract	Most proofs showing limitations of expressive power of first-order logic rely on Ehrenfeucht-Fraisse games. Playing the game often involves a nontrivial combinatorial argument, so it was proposed to find easier tools for proving expressivity bounds. Most of those known for first-order logic are based on its "locality", that is defined in different ways. In this paper we characterize the relationship between those notions of locality. We note that Gaifman's locality theorem gives rise to two notions: one deals with sentences and one with open formulae. We prove that the former implies Hauf's notion of locality, which in turn implies Gaifman's locality for open formulae. Each of these implies the bounded degree property, which is one of the easiest tools for proving expressivity bounds. These results apply beyond the first-order case. We use them to derive expressivity bounds for first-order logic with unary quantifiers and counting. Finally, we apply these results to relational database languages with aggregate functions, and prove that purely relational queries defined in such languages satisfy Gaifman's notion of locality. From this we derive a number of expressivity bounds for languages with aggregates.
Starting Page	204
Ending Page	215
File Size	1177653
Page Count	12
File Format	PDF
ISBN	0818679255
ISSN	10436871
DOI	10.1109/LICS.1997.614948
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-06-29
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Logic Relational databases Aggregates Database languages Application software Computer science Calculus Libraries Proposals
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Logics with aggregate operators

Multidatabase language requirements

Translating object query language

Successor-invariance in the finite

An efficient park service management package

Algebraic foundation and optimization for object based query languages

Aggregates in the temporal query language TQuel

On the completeness of object-creating query languages

Expressive equivalence of least and inflationary fixed-point logic

On the forms of locality over finite models

Similar Documents

Logics with aggregate operators

Multidatabase language requirements

Translating object query language

Successor-invariance in the finite

An efficient park service management package

Algebraic foundation and optimization for object based query languages

Aggregates in the temporal query language TQuel

On the completeness of object-creating query languages

Expressive equivalence of least and inflationary fixed-point logic

On the forms of locality over finite models