首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Recursive undecidability of the binding property for finitely presented equational classes
Authors:Stephane Foldes  Gert Sabidussi
Institution:(1) Université de Montréal, Montréal, Québec, Canada
Abstract:It is shown that there exists no algorithm which, given a finite presentation of an equational classC, decides whether the category of algebras inC is binding.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号