Inclusion Logic and Fixed Point Logic
Pietro Galliani, Lauri Hella
Abstract
Pietro Galliani, Lauri Hella
Abstract
We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics \nextended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest \nFixed Point Logic, and we prove that all union-closed first-order definable properties of relations \nare definable in it. We also provide an Ehrenfeucht-Fraïssé game for Inclusion Logic, and give an \nexample illustrating its use.
OpenAlex reports 34 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics \nextended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest \nFixed Point Logic, and we prove that all union-closed first-order definable properties of relations \nare definable in it. We also provide an Ehrenfeucht-Fraïssé game for Inclusion Logic, and give an \nexample illustrating its use.
Key concepts: Higher-order logic, Inclusion (mineral), Second-order logic, Mathematics, First-order logic, Computer science, Discrete mathematics, Multimodal logic