{"title":"非一致性设置中的非偶然性","authors":"Daniil Kozhemiachenko, Liubov Vashentseva","doi":"10.1093/jigpal/jzac081","DOIUrl":null,"url":null,"abstract":"Abstract We study an extension of first-degree entailment (FDE) by Dunn and Belnap with a non-contingency operator $\\blacktriangle \\phi $ which is construed as ‘$\\phi $ has the same value in all accessible states’ or ‘all sources give the same information on the truth value of $\\phi $’. We equip this logic dubbed $\\textbf {K}^\\blacktriangle _{\\textbf {FDE}}$ with frame semantics and show how the bi-valued models can be interpreted as interconnected networks of Belnapian databases with the $\\blacktriangle $ operator modelling search for inconsistencies in the provided information. We construct an analytic cut system for the logic and show its soundness and completeness. We prove that $\\blacktriangle $ is not definable via the necessity modality $\\Box $ of $\\textbf {K}_{\\textbf{FDE}}$. Furthermore, we prove that in contrast to the classical non-contingency logic, reflexive, $\\textbf {S4}$ and $\\textbf {S5}$ (among others) frames are definable.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":"11 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Non-contingency in a Paraconsistent Setting\",\"authors\":\"Daniil Kozhemiachenko, Liubov Vashentseva\",\"doi\":\"10.1093/jigpal/jzac081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We study an extension of first-degree entailment (FDE) by Dunn and Belnap with a non-contingency operator $\\\\blacktriangle \\\\phi $ which is construed as ‘$\\\\phi $ has the same value in all accessible states’ or ‘all sources give the same information on the truth value of $\\\\phi $’. We equip this logic dubbed $\\\\textbf {K}^\\\\blacktriangle _{\\\\textbf {FDE}}$ with frame semantics and show how the bi-valued models can be interpreted as interconnected networks of Belnapian databases with the $\\\\blacktriangle $ operator modelling search for inconsistencies in the provided information. We construct an analytic cut system for the logic and show its soundness and completeness. We prove that $\\\\blacktriangle $ is not definable via the necessity modality $\\\\Box $ of $\\\\textbf {K}_{\\\\textbf{FDE}}$. Furthermore, we prove that in contrast to the classical non-contingency logic, reflexive, $\\\\textbf {S4}$ and $\\\\textbf {S5}$ (among others) frames are definable.\",\"PeriodicalId\":51114,\"journal\":{\"name\":\"Logic Journal of the IGPL\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-01-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic Journal of the IGPL\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/jigpal/jzac081\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic Journal of the IGPL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/jigpal/jzac081","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
Abstract We study an extension of first-degree entailment (FDE) by Dunn and Belnap with a non-contingency operator $\blacktriangle \phi $ which is construed as ‘$\phi $ has the same value in all accessible states’ or ‘all sources give the same information on the truth value of $\phi $’. We equip this logic dubbed $\textbf {K}^\blacktriangle _{\textbf {FDE}}$ with frame semantics and show how the bi-valued models can be interpreted as interconnected networks of Belnapian databases with the $\blacktriangle $ operator modelling search for inconsistencies in the provided information. We construct an analytic cut system for the logic and show its soundness and completeness. We prove that $\blacktriangle $ is not definable via the necessity modality $\Box $ of $\textbf {K}_{\textbf{FDE}}$. Furthermore, we prove that in contrast to the classical non-contingency logic, reflexive, $\textbf {S4}$ and $\textbf {S5}$ (among others) frames are definable.
期刊介绍:
Logic Journal of the IGPL publishes papers in all areas of pure and applied logic, including pure logical systems, proof theory, model theory, recursion theory, type theory, nonclassical logics, nonmonotonic logic, numerical and uncertainty reasoning, logic and AI, foundations of logic programming, logic and computation, logic and language, and logic engineering.
Logic Journal of the IGPL is published under licence from Professor Dov Gabbay as owner of the journal.