Rings with common division, common meadows and their conditional equational theories

Jan A Bergstra, John V Tucker
{"title":"Rings with common division, common meadows and their conditional equational theories","authors":"Jan A Bergstra, John V Tucker","doi":"arxiv-2405.01733","DOIUrl":null,"url":null,"abstract":"We examine the consequences of having a total division operation\n$\\frac{x}{y}$ on commutative rings. We consider two forms of binary division,\none derived from a unary inverse, the other defined directly as a general\noperation; each are made total by setting $1/0$ equal to an error value $\\bot$,\nwhich is added to the ring. Such totalised divisions we call common divisions.\nIn a field the two forms are equivalent and we have a finite equational\naxiomatisation $E$ that is complete for the equational theory of fields\nequipped with common division, called common meadows. These equational axioms\n$E$ turn out to be true of commutative rings with common division but only when\ndefined via inverses. We explore these axioms $E$ and their role in seeking a\ncompleteness theorem for the conditional equational theory of common meadows.\nWe prove they are complete for the conditional equational theory of commutative\nrings with inverse based common division. By adding a new proof rule, we can\nprove a completeness theorem for the conditional equational theory of common\nmeadows. Although, the equational axioms $E$ fail with common division defined\ndirectly, we observe that the direct division does satisfies the equations in\n$E$ under a new congruence for partial terms called eager equality.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"284 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.01733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We examine the consequences of having a total division operation $\frac{x}{y}$ on commutative rings. We consider two forms of binary division, one derived from a unary inverse, the other defined directly as a general operation; each are made total by setting $1/0$ equal to an error value $\bot$, which is added to the ring. Such totalised divisions we call common divisions. In a field the two forms are equivalent and we have a finite equational axiomatisation $E$ that is complete for the equational theory of fields equipped with common division, called common meadows. These equational axioms $E$ turn out to be true of commutative rings with common division but only when defined via inverses. We explore these axioms $E$ and their role in seeking a completeness theorem for the conditional equational theory of common meadows. We prove they are complete for the conditional equational theory of commutative rings with inverse based common division. By adding a new proof rule, we can prove a completeness theorem for the conditional equational theory of common meadows. Although, the equational axioms $E$ fail with common division defined directly, we observe that the direct division does satisfies the equations in $E$ under a new congruence for partial terms called eager equality.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有共同分割、共同草地的环及其条件等式理论
我们研究了在交换环上使用总除法运算$\frac{x}{y}$ 的后果。我们考虑了二进制除法的两种形式,一种是从一元逆运算衍生出来的,另一种是直接定义为一般运算的;每种形式都是通过设置$1/0$等于误差值$\bot$来实现总除法的,误差值被添加到环中。在一个域中,这两种形式是等价的,而且我们有一个有限的等式公理化$E$,它对于具有共分的域sequipped with common division 的等式理论是完备的,称为共草地。这些等式公理 $E$ 在有公分的交换环中也是成立的,但只有在通过倒数定义时才成立。我们探讨了这些公理$E$及其在寻求共面草地的条件等式理论的完备性定理中的作用,并证明了它们对于具有基于逆的共分的交换环的条件等式理论是完备的。通过增加新的证明规则,我们可以证明条件等式公理的完备性定理。尽管在直接定义的公分法下等式公理 $E$ 失效,但我们观察到,在一个新的部分项全等式(称为急切相等)下,直接除法确实满足等式公理 $E$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Synthesizing Evolving Symbolic Representations for Autonomous Systems Introducing Quantification into a Hierarchical Graph Rewriting Language Towards Verified Polynomial Factorisation Symbolic Regression with a Learned Concept Library Active Symbolic Discovery of Ordinary Differential Equations via Phase Portrait Sketching
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1