项重写系统的算术非表达性

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science Pub Date : 1988-07-05 DOI:10.1109/LICS.1988.5120

S. Vorobyov

{"title":"项重写系统的算术非表达性","authors":"S. Vorobyov","doi":"10.1109/LICS.1988.5120","DOIUrl":null,"url":null,"abstract":"Unquantified Presburger arithmetic is proved to be nonaxiomatizable by a canonical (i.e. Noetherian and confluent) term-rewriting system, if Boolean connectives are not allowed in the left-hand sides of the rewrite rules. It is conjectured that the same is true if the number of Boolean connectives in left-hand sides of the rules is uniformly bounded by an arbitrary natural number.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"On the arithmetic inexpressiveness of term rewriting systems\",\"authors\":\"S. Vorobyov\",\"doi\":\"10.1109/LICS.1988.5120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unquantified Presburger arithmetic is proved to be nonaxiomatizable by a canonical (i.e. Noetherian and confluent) term-rewriting system, if Boolean connectives are not allowed in the left-hand sides of the rewrite rules. It is conjectured that the same is true if the number of Boolean connectives in left-hand sides of the rules is uniformly bounded by an arbitrary natural number.<<ETX>>\",\"PeriodicalId\":425186,\"journal\":{\"name\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"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.5120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.5120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

在正则(即noether和合流)项重写系统中，如果重写规则的左侧不允许布尔连接词，则证明了非量化Presburger算法是不可公理化的。如果规则左边的布尔连接词的数目被一个任意自然数一致地限定，则推测其成立。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the arithmetic inexpressiveness of term rewriting systems

Unquantified Presburger arithmetic is proved to be nonaxiomatizable by a canonical (i.e. Noetherian and confluent) term-rewriting system, if Boolean connectives are not allowed in the left-hand sides of the rewrite rules. It is conjectured that the same is true if the number of Boolean connectives in left-hand sides of the rules is uniformly bounded by an arbitrary natural number.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science

自引率

0.00%

发文量