Strongly representable atom structures of relation algebras

Author:

Hirsch Robin,Hodkinson Ian

Abstract

A relation algebra atom structure α \alpha is said to be strongly representable if all atomic relation algebras with that atom structure are representable. This is equivalent to saying that the complex algebra C m α \mathfrak {Cm} \alpha is a representable relation algebra. We show that the class of all strongly representable relation algebra atom structures is not closed under ultraproducts and is therefore not elementary. This answers a question of Maddux (1982). Our proof is based on the following construction. From an arbitrary undirected, loop-free graph Γ \Gamma , we construct a relation algebra atom structure α ( Γ ) \alpha (\Gamma ) and prove, for infinite Γ \Gamma , that α ( Γ ) \alpha (\Gamma ) is strongly representable if and only if the chromatic number of Γ \Gamma is infinite. A construction of Erdös shows that there are graphs Γ r \Gamma _r ( r > ω r>\omega ) with infinite chromatic number, with a non-principal ultraproduct D Γ r \prod _D\Gamma _r whose chromatic number is just two. It follows that α ( Γ r ) \alpha (\Gamma _r) is strongly representable (each r > ω r>\omega ) but D ( α ( Γ r ) ) \prod _D(\alpha (\Gamma _r)) is not.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference25 articles.

1. Complexity of equations valid in algebras of relations. I. Strong non-finitizability;Andréka, Hajnal;Ann. Pure Appl. Logic,1997

2. Colloquia Mathematica Societatis J\'{a}nos Bolyai,1991

3. Studies in Logic and the Foundations of Mathematics;Chang, C. C.,1990

4. R. Diestel, Graph theory, Graduate Texts in Mathematics, vol. 173, Springer-Verlag, Berlin, 1997.

5. Graph theory and probability;Erdős, P.;Canadian J. Math.,1959

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

1. Existence of Certain Finite Relation Algebras Implies Failure of Omitting Types for L n;Notre Dame Journal of Formal Logic;2020-11-01

2. On the variety generated by completions of representable relation algebras;Algebra universalis;2020-02-06

3. Subcompletions of representable relation algebras;Algebra universalis;2018-04-17

4. Meet-completions and ordered domain algebras;Logic Journal of IGPL;2015-04-13

5. Splitting Atoms in Relational Algebras;Relational and Algebraic Methods in Computer Science;2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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