{"title":"模态逻辑的多项式语义","authors":"J. C. Agudelo, Santiago Echeverri-Valencia","doi":"10.1080/11663081.2019.1676004","DOIUrl":null,"url":null,"abstract":"ABSTRACT It is shown here that the modal logic K and any extension of it with a finite number of axioms can be characterised by a polynomial semantics. Moreover, some comments are made about the possibility of using algebraic computation to determine deducibility on these logics.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"8 1","pages":"430 - 449"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Polynomial semantics for modal logics\",\"authors\":\"J. C. Agudelo, Santiago Echeverri-Valencia\",\"doi\":\"10.1080/11663081.2019.1676004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT It is shown here that the modal logic K and any extension of it with a finite number of axioms can be characterised by a polynomial semantics. Moreover, some comments are made about the possibility of using algebraic computation to determine deducibility on these logics.\",\"PeriodicalId\":38573,\"journal\":{\"name\":\"Journal of Applied Non-Classical Logics\",\"volume\":\"8 1\",\"pages\":\"430 - 449\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Non-Classical Logics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/11663081.2019.1676004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Non-Classical Logics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/11663081.2019.1676004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
ABSTRACT It is shown here that the modal logic K and any extension of it with a finite number of axioms can be characterised by a polynomial semantics. Moreover, some comments are made about the possibility of using algebraic computation to determine deducibility on these logics.