Inclusion Logic and Fixed Point Logic

Inclusion Logic and Fixed Point Logic
复制标题

包含逻辑和定点逻辑

DOI:
--
复制
发表时间:
2013
期刊:
Annual Conference for Computer Science Logic
影响因子:
--
通讯作者:
L. Hella
L. Hella
中科院分区:
--
文献类型:
--
作者:
P. Galliani;L. Hella

文献摘要

被引文献

相似文献

我们研究包含逻辑的属性,即具有通过包含依赖项扩展的团队语义的一阶逻辑。我们证明了包含逻辑等价于最大不动点逻辑,并且证明了关系的所有并闭一阶可定义属性在其中都是可定义的。我们还为包含逻辑提供了一个 Ehrenfeucht-Fra'iss'e 游戏,并给出了一个示例来说明其使用。
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\"iss\'e game for Inclusion Logic, and give an example illustrating its use.