Adding For-Loops to First-Order Logic

Authors:
Frank Neven;Martin Otto;Jerzy Tyszkiewicz;Jan Van den Bussche
Affiliations:
-;-;-;-
Venue:
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Year:
1999

Citing 5
Cited 1

Computing with first-order logic

Selected papers of the 23rd annual ACM symposium on Theory of computing
Theory of database queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Programming primitives for database languages

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inductive Definability with Counting on Finite Structures

CSL '92 Selected Papers from the Workshop on Computer Science Logic

Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the query language BQL: the extension of the relational algebra with for-loops. We also study FO(FOR): the extension of first-order logic with a for-loop variant of the partial fixpoint operator. In contrast to the known situation with query languages which include while-loops instead of for-loops, BQL and FO(FOR) are not equivalent. Among the topics we investigate are: the precise relationship between BQL and FO(FOR); inflationary versus non-inflationary iteration; the relationship with logics that have the ability to count; and nested versus unnested loops.