模态逻辑的拓扑积与麦肯锡公理

IF 0.5 4区数学 Q3 MATHEMATICS Doklady Mathematics Pub Date : 2024-04-18 DOI:10.1134/S1064562424701825

A. V. Kudinov

{"title":"模态逻辑的拓扑积与麦肯锡公理","authors":"A. V. Kudinov","doi":"10.1134/S1064562424701825","DOIUrl":null,"url":null,"abstract":"<p>We consider products of modal logics in topological semantics and prove that the topological product of S4.1 and S4 is the fusion of logics S4.1 and S4 plus one extra asiom. This is an example of a topological product of logics that is greater than the fusion but less than the semiproduct of the corresponding logics. We also show that this product is decidable.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"109 1","pages":"66 - 72"},"PeriodicalIF":0.5000,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Topological Product of Modal Logics with the McKinsey Axiom\",\"authors\":\"A. V. Kudinov\",\"doi\":\"10.1134/S1064562424701825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We consider products of modal logics in topological semantics and prove that the topological product of S4.1 and S4 is the fusion of logics S4.1 and S4 plus one extra asiom. This is an example of a topological product of logics that is greater than the fusion but less than the semiproduct of the corresponding logics. We also show that this product is decidable.</p>\",\"PeriodicalId\":531,\"journal\":{\"name\":\"Doklady Mathematics\",\"volume\":\"109 1\",\"pages\":\"66 - 72\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Doklady Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1134/S1064562424701825\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562424701825","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

摘要我们考虑了模态逻辑在拓扑语义学中的乘积，并证明 S4.1 和 S4 的拓扑乘积是逻辑 S4.1 和 S4 的融合加上一个额外的阿西莫。这是逻辑的拓扑积大于融合积而小于相应逻辑的半积的一个例子。我们还证明了这一积是可解的。

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

摘要图片

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Topological Product of Modal Logics with the McKinsey Axiom

We consider products of modal logics in topological semantics and prove that the topological product of S4.1 and S4 is the fusion of logics S4.1 and S4 plus one extra asiom. This is an example of a topological product of logics that is greater than the fusion but less than the semiproduct of the corresponding logics. We also show that this product is decidable.

求助全文

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

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.