2026-07-22T16:59:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4203 2024-03-06T10:34:53Z ddc:004 open_access

Inclusion Logic and Fixed Point Logic Galliani, Pietro Hella, Lauri Dependence Logic Team Semantics Fixpoint Logic Inclusion 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pietro Galliani and Lauri Hella 2013 Is Part Of LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2013.281 urn:nbn:de:0030-drops-42031 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.281 eng https://creativecommons.org/licenses/by/3.0/legalcode