{"title":"Hyperintensional models for non-congruential modal logics","authors":"Matteo Pascucci, Igor Sedlár","doi":"10.1093/jigpal/jzad018","DOIUrl":null,"url":null,"abstract":"Abstract In this work, we illustrate applications of a semantic framework for non-congruential modal logic based on hyperintensional models. We start by discussing some philosophical ideas behind the approach; in particular, the difference between the set of possible worlds in which a formula is true (its intension) and the semantic content of a formula (its hyperintension), which is captured in a rigorous way in hyperintensional models. Next, we rigorously specify the approach and provide a fundamental completeness theorem. Moreover, we analyse examples of non-congruential systems that can be semantically characterized within this framework in an elegant and modular way. Finally, we compare the proposed framework with some alternatives available in the literature. In the light of the results obtained, we argue that hyperintensional models constitute a basic, general and unifying semantic framework for (non-congruential) modal logic.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/jigpal/jzad018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract In this work, we illustrate applications of a semantic framework for non-congruential modal logic based on hyperintensional models. We start by discussing some philosophical ideas behind the approach; in particular, the difference between the set of possible worlds in which a formula is true (its intension) and the semantic content of a formula (its hyperintension), which is captured in a rigorous way in hyperintensional models. Next, we rigorously specify the approach and provide a fundamental completeness theorem. Moreover, we analyse examples of non-congruential systems that can be semantically characterized within this framework in an elegant and modular way. Finally, we compare the proposed framework with some alternatives available in the literature. In the light of the results obtained, we argue that hyperintensional models constitute a basic, general and unifying semantic framework for (non-congruential) modal logic.