{"title":"包含Routley和Meyer基本逻辑Bd的Belnap-Dunn逻辑的所有4值隐含展开的格","authors":"Gemma Robles, José M Méndez","doi":"10.1093/jigpal/jzad005","DOIUrl":null,"url":null,"abstract":"Abstract The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with $\\wedge $, $\\vee $ and $\\sim $ as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B$^{\\textrm {d}}$. It is to be noted that Boolean negation (so, classical propositional logic) is definable in the strongest element in the said class.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The lattice of all 4-valued implicative expansions of Belnap–Dunn logic containing Routley and Meyer’s basic logic B<i>d</i>\",\"authors\":\"Gemma Robles, José M Méndez\",\"doi\":\"10.1093/jigpal/jzad005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with $\\\\wedge $, $\\\\vee $ and $\\\\sim $ as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B$^{\\\\textrm {d}}$. It is to be noted that Boolean negation (so, classical propositional logic) is definable in the strongest element in the said class.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-03-25\",\"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/jzad005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/jigpal/jzad005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The lattice of all 4-valued implicative expansions of Belnap–Dunn logic containing Routley and Meyer’s basic logic Bd
Abstract The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with $\wedge $, $\vee $ and $\sim $ as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B$^{\textrm {d}}$. It is to be noted that Boolean negation (so, classical propositional logic) is definable in the strongest element in the said class.