CONNEXIVE CONDITIONAL LOGIC. Part I.
In this paper, first some propositional conditional logics based on Belnap and Dunn's useful four-valued logic of first-degree entailment are introduced semantically, which are then turned into systems of weakly and unrestrictedly connexive conditional logic. The general frame semantics for these lo...
| Publicado en: | Logic & Logical Philosophy Vol. 28; no. 3; pp. 567 - 611 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Logic & Logical Philosophy
Sep2019
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=138802948&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 138802948 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 14253305 DS9 jtl: Logic & Logical Philosophy issn: 14253305 maglogo: N pubinfo: dt: Sep2019 vid: 28 iid: 3 pid: 42904 pub: Logic & Logical Philosophy artinfo: ui: 138802948 10.12775/LLP.2018.018 ppf: 567 ppct: 44 formats: fmt: @attributes: type: P size: 2.7MB tig: atl: CONNEXIVE CONDITIONAL LOGIC. Part I. aug: au: Wansing, Heinrich Unterhuber, Matthias affil: Faculty of Philosophy and Educational Research Department of Philosophy I Ruhr-University Bochum, Germany Faculty of Philosophy and Educational Research Department of Philosophy II Ruhr-University Bochum, Germany su: Relevance logic Mathematical logic Natural deduction (Logic) Semantics Completeness theorem sug: subj: Relevance logic Mathematical logic Natural deduction (Logic) Semantics Completeness theorem keyword: Aris-totle's theses Boethius' theses Chellas frames conditional logic connexive logic extension/anti-extension pairs first-degree entailment logic general frames paraconsistent logic Segerberg frames tableaux ab: In this paper, first some propositional conditional logics based on Belnap and Dunn's useful four-valued logic of first-degree entailment are introduced semantically, which are then turned into systems of weakly and unrestrictedly connexive conditional logic. The general frame semantics for these logics makes use of a set of allowable (or admissible) extension/anti- extension pairs. Next, sound and complete tableau calculi for these logics are presented. Moreover, an expansion of the basic conditional connexive logics by a constructive implication is considered, which gives an oppor- tunity to discuss recent related work, motivated by the combination of indicative and counterfactual conditionals. Tableau calculi for the basic constructive connexive conditional logics are defined and shown to be sound and complete with respect to their semantics. This semantics has to ensure a persistence property with respect to the preorder that is used to interpret the constructive implication. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Copyright of Logic & Logical Philosophy is the property of Logic & Logical Philosophy and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. item: Logic & Logical Philosophy holder: Logic & Logical Philosophy dt: @attributes: year: 2019 holdings: @attributes: islocal: N |
|---|