Proof by consistency in equational theories

L. Bachmair
{"title":"Proof by consistency in equational theories","authors":"L. Bachmair","doi":"10.1109/LICS.1988.5122","DOIUrl":null,"url":null,"abstract":"A method is proven for proving that equations are valid in the initial model of an equational variety. This proof by consistency procedure can be applied to equational theories that are represented as ground convergent rewrite systems. In contrast with so-called inductive completion procedures, the method requires no specific ordering on terms and can handle unorientable equations. The method is linear and refutationally complete, in that it refutes any equation which is not an inductive theorem.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"121","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1988.5122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 121

Abstract

A method is proven for proving that equations are valid in the initial model of an equational variety. This proof by consistency procedure can be applied to equational theories that are represented as ground convergent rewrite systems. In contrast with so-called inductive completion procedures, the method requires no specific ordering on terms and can handle unorientable equations. The method is linear and refutationally complete, in that it refutes any equation which is not an inductive theorem.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
等式理论中的一致性证明
给出了一种证明方程在方程变元初始模型中有效的方法。这种一致性过程的证明可以应用于表示为地面收敛重写系统的方程理论。与所谓的归纳补全过程相反,该方法不需要对项进行特定的排序,可以处理不可定向方程。这个方法是线性的,并且在反驳上是完备的,因为它反驳了任何不是归纳定理的方程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Petri nets are monoids: a new algebraic foundation for net theory Complete axiomatizations of the algebras of finite, rational and infinite trees Notational definition-a formal account A modal process logic A category of labelled Petri nets and compositional proof system
×
引用
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