Undecidability of representability as binary relations

Author:

Hirsch Robin,Jackson Marcel

Abstract

AbstractIn this article we establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson's relation algebra. We also establish a number of undecidability results for representability as algebras of injective functions.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference62 articles.

1. An Invitation to C-semigroups

2. On the ‘union-relation composition’ reducts of relation algebras;Andréka;Abstracts of Papers Presented to the American Mathematical Society,1989

3. On certain classes of semigroups of binary relations;Schein;Rossisškaya Akademiya Nauk. Sibirskoe Otdelenie,1965

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Implication Algebras and Implication Semigroups of Binary Relations;Relational and Algebraic Methods in Computer Science;2023

2. Restriction in Program Algebra;Logic Journal of the IGPL;2022-07-19

3. Ehresmann theory and partition monoids;Journal of Algebra;2021-08

4. Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

5. Finite representability of semigroups with demonic refinement;Algebra universalis;2021-04-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3