A tableau style proof system for two paraconsistent logics (Q1309339): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q452355 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Graham Priest / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093634659 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988056011 / rank | |||
Normal rank | |||
Latest revision as of 00:46, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tableau style proof system for two paraconsistent logics |
scientific article |
Statements
A tableau style proof system for two paraconsistent logics (English)
0 references
6 December 1993
0 references
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.
0 references
semantic tableaux
0 references
tableau proof-theory
0 references
LP
0 references
First Degree Entailment
0 references
