{"title":"论关联二元模态命题逻辑的不可判定性","authors":"Michael Kaminski","doi":"10.1007/s00153-024-00921-w","DOIUrl":null,"url":null,"abstract":"<div><p>It is shown that both classical and intuitionistic propositional logics of an associative binary modality are undecidable. The proof is based on the deduction theorem for these logics.</p></div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":"63 7-8","pages":"837 - 857"},"PeriodicalIF":0.3000,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00153-024-00921-w.pdf","citationCount":"0","resultStr":"{\"title\":\"On undecidability of the propositional logic of an associative binary modality\",\"authors\":\"Michael Kaminski\",\"doi\":\"10.1007/s00153-024-00921-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>It is shown that both classical and intuitionistic propositional logics of an associative binary modality are undecidable. The proof is based on the deduction theorem for these logics.</p></div>\",\"PeriodicalId\":48853,\"journal\":{\"name\":\"Archive for Mathematical Logic\",\"volume\":\"63 7-8\",\"pages\":\"837 - 857\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2024-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00153-024-00921-w.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archive for Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00153-024-00921-w\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archive for Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00153-024-00921-w","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
On undecidability of the propositional logic of an associative binary modality
It is shown that both classical and intuitionistic propositional logics of an associative binary modality are undecidable. The proof is based on the deduction theorem for these logics.
期刊介绍：
The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
