Inclusion Logic and Fixed Point Logic

Galliani, Pietro; Hella, Lauri

doi:10.4230/LIPIcs.CSL.2013.281

Document

Inclusion Logic and Fixed Point Logic

Authors Pietro Galliani, Lauri Hella

Part of: Volume: Computer Science Logic 2013 (CSL 2013)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Computer Science Logic (CSL)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2013-09-02

PDF

File

PDF

LIPIcs.CSL.2013.281.pdf

Filesize: 0.53 MB
15 pages

Document Identifiers

DOI: 10.4230/LIPIcs.CSL.2013.281
URN: urn:nbn:de:0030-drops-42031

Subject Classification

Keywords

Dependence Logic
Team Semantics
Fixpoint Logic
Inclusion

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all union-closed first-order definable properties of relations are definable in it. We also provide an Ehrenfeucht-Fraïssé game for Inclusion Logic, and give an example illustrating its use.

Cite As Get BibTex

Pietro Galliani and Lauri Hella. Inclusion Logic and Fixed Point Logic. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 281-295, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.CSL.2013.281

Author Details

Pietro Galliani

Lauri Hella

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail