The reducts of equality up to primitive positive interdefinability
The reducts of equality up to primitive positive interdefinability
复制标题
将平等还原为原始积极的可相互定义性
DOI：
10.2178/jsl/1286198146
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
M. Pinsker
中科院分区：
文献类型：
--
作者：
M. Bodirsky;Hubie Chen;M. Pinsker
摘要我们开始研究关系结构的约简直到本原正定义性：在提供了这样的研究工具之后，我们应用这些工具来获得相等逻辑的约简的分类。事实证明，存在这样的约化的连续体。等价地，用泛代数的语言表示，我们对包含域的所有排列的可数域上的局部闭克隆进行分类。
Abstract We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of equality. It turns out that there exists a continuum of such reducts. Equivalently, expressed in the language of universal algebra, we classify those locally closed clones over a countable domain which contain all permutations of the domain.