Counting in the Two Variable Guarded Logic with Transitivity
Counting in the Two Variable Guarded Logic with Transitivity
复制标题
具有传递性的二变量保护逻辑的计数
DOI:
--
复制
发表时间:
2005
期刊:
影响因子:
--
通讯作者:
Lidia Tendera
中科院分区:
文献类型:
--
作者:
Lidia Tendera
We show that the extension of the two-variable guarded fragment with transitive guards (GF+TG) by functionality statements is undecidable. This gives immediately undecidability of the extension of GF+TG by counting quantifiers. The result is optimal, since both the three-variable fragment of the guarded fragment with counting quantifiers and the two-variable guarded fragment with transitivity are undecidable.
We also show that the extension of GF+TG with functionality, where functional predicate letters appear in guards only, is decidable and of the same complexity as GF+TG. This fragment captures many expressive modal and description logics.