arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.11955cs.LOcs.CCmath.LO
收藏

论逻辑与同态闭包

On Logics and Homomorphism Closure

Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph

摘要:

谓词逻辑是指定关系结构类的首选。同态是描述关系结构之间的对应关系的关键。关于这两种表征(类)结构的方法之间的相互依赖性的问题具有根本的意义,并且可以是非常不容易回答的。本文研究了关于逻辑句子的所有(有限或任意)模型类的同态闭包(homclosure)的几个问题:句子的homclosure中结构的成员关系;句子的homclosedness;逻辑中的homclosure的可刻画性;某些逻辑中homclosed句子的范式。对于一阶和二阶谓词逻辑的各种各样的片段,我们澄清这些问题的计算性质。

英文摘要:

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of characterizing (classes of) structures are of fundamental interest and can be highly non-trivial to answer. We investigate several problems regarding the homomorphism closure (homclosure) of the class of all (finite or arbitrary) models of logical sentences: membership of structures in a sentence's homclosure; sentence homclosedness; homclosure characterizability in a logic; normal forms for homclosed sentences in certain logics. For a wide variety of fragments of first- and second-order predicate logic, we clarify these problems' computational properties.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑