{"title":"Complete axiomatizations of the algebras of finite, rational and infinite trees","authors":"Michael J. Maher","doi":"10.1109/LICS.1988.5132","DOIUrl":null,"url":null,"abstract":"Complete axiomizations for the algebras of infinite trees and infinite trees are presented. The axiomizations are parameterized by the alphabet of function symbols for both the finite trees and infinite trees. There are two main cases, depending on whether the number of function symbols is finite or infinite. In the former case an extra axiom is necessary to obtain completeness. The method of proof is an elimination of quantifiers. Although a full elimination of quantifiers is not possible, the method forms the basis of decision procedures for the theories of the corresponding algebras. As a corollary to the results in infinite trees, the elementary equivalence of the algebra of rational trees and the algebra of infinite trees is obtained.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"313","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.5132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 313
Abstract
Complete axiomizations for the algebras of infinite trees and infinite trees are presented. The axiomizations are parameterized by the alphabet of function symbols for both the finite trees and infinite trees. There are two main cases, depending on whether the number of function symbols is finite or infinite. In the former case an extra axiom is necessary to obtain completeness. The method of proof is an elimination of quantifiers. Although a full elimination of quantifiers is not possible, the method forms the basis of decision procedures for the theories of the corresponding algebras. As a corollary to the results in infinite trees, the elementary equivalence of the algebra of rational trees and the algebra of infinite trees is obtained.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
