The semijoin algebra and the guarded fragment
Dirk Leinders (1), Jerzy Tyszkiewicz (2), Jan Van den Bussche (1) ((1), Limburgs Universitair Centrum, Diepenbeek, Belgium, (2) Institute of, Informatics, Warsaw University, Warsaw, Poland)

TL;DR
This paper explores the semijoin algebra, a variant of relational algebra, and its connections to the guarded fragment of first-order logic, including a game-based method to analyze its expressive power.
Contribution
It establishes links between the semijoin algebra and the guarded fragment, and introduces an Ehrenfeucht-Fraisse game to characterize its expressive capabilities.
Findings
The semijoin algebra is related to the guarded fragment of first-order logic.
The Ehrenfeucht-Fraisse game characterizes the expressive power of the semijoin algebra.
The game provides a method to show non-expressibility of certain queries.
Abstract
The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We discuss some interesting connections between the semijoin algebra and the guarded fragment of first-order logic. We also provide an Ehrenfeucht-Fraisse game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that certain queries are not expressible in the semijoin algebra.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · semigroups and automata theory
