A tableau style proof system for two paraconsistent logics
type: Item
instance of: scholarly article
title: A tableau style proof system for two paraconsistent logics
zbMATH Open document ID: 0792.03013
author: Anthony Bloesch
published in: Notre Dame Journal of Formal Logic
publication date: 1993-12-06T00:00:00Z
review text: The paper provides a tableau proof-theory for the propositional logics LP [see the reviewer, J. Philos. Logic 8, 219-241 (1979; Zbl 0402.03012)] and First Degree Entailment [see section 50.3 of \textit{A. R. Anderson}, \textit{N. D. Belnap} and \textit{J. M. Dunn}: Entailment: the logic of relevance and necessity, Vol. II, Princeton University Press (1992)]. The major difference from tableaux for classical logic is that formulas are signed, and the tableaux rules operate on the signs as well as the formulas. Soundness and completeness are established by extensions of the usual classical techniques.
Mathematics Subject Classification ID: 03B53
Mathematics Subject Classification ID: 03B47
zbMATH DE Number: 469222
zbMATH Keywords: semantic tableaux
zbMATH Keywords: tableau proof-theory
zbMATH Keywords: LP
zbMATH Keywords: First Degree Entailment
reviewed by: Graham Priest
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1093634659
OpenAlex ID: W1988056011
DOI: 10.1305/NDJFL/1093634659
Recommended article: Prefixed Tableau Systems for Logic of Proofs and Provability
Recommended article: Q4870569
Recommended article: Tableau systems for paraconsistency and minimal inconsistency
Recommended article: TABLEAUX: A general theorem prover for modal logics
Recommended article: A tableau proof system for a mazurkiewicz trace logic with fixpoints
Recommended article: A tableau-like proof procedure for normal modal logics
Recommended article: Q5411438
Recommended article: Tableaux for intuitionistic logics
Recommended article: Tableaux and hypersequents for justification logics
Recommended article: Q3344174
description: scientific article; zbMATH DE number 469222