License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2013.281
URN: urn:nbn:de:0030-drops-42031
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4203/
Go to the corresponding LIPIcs Volume Portal

Galliani, Pietro ; Hella, Lauri

Inclusion Logic and Fixed Point Logic

pdf-format:
23.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{galliani_et_al:LIPIcs:2013:4203,
  author =	{Pietro Galliani and Lauri Hella},
  title =	{{Inclusion Logic and Fixed Point Logic}},
  booktitle =	{Computer Science Logic 2013 (CSL 2013)},
  pages =	{281--295},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-60-6},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{23},
  editor =	{Simona Ronchi Della Rocca},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4203},
  URN =		{urn:nbn:de:0030-drops-42031},
  doi =		{10.4230/LIPIcs.CSL.2013.281},
  annote =	{Keywords: Dependence Logic, Team Semantics, Fixpoint Logic, Inclusion}
}

Keywords: Dependence Logic, Team Semantics, Fixpoint Logic, Inclusion
Collection: Computer Science Logic 2013 (CSL 2013)
Issue Date: 2013
Date of publication: 02.09.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI