The RM paraconsistent refutation system
DOI:
https://doi.org/10.12775/LLP.2009.005Keywords
refutation systems, paraconsistent logic, relevance logicAbstract
The aim of this paper is to study the refutation system consisting of the refutation axiom p ∧ ¬p → q and the refutation rules: reverse substitution and reverse modus ponens (B/A, if A → B ∈ RM). It is shown that the refutation system is characteristic for the logic of the 3-element RM algebra.References
Dunn, J.M., “Algebraic completeness results for R-Mingle and its extensions”, Journal of Symbolic Logic 35 (1970): 1–13.
Łukasiewicz, J., Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic, Oxford, 1951.
Skura, T., “Maximality and refutability”, Notre Dame Journal of Formal Logic 45 (2004): 65–72.
Downloads
Published
2009-08-15
How to Cite
1.
SKURA, Tomasz. The RM paraconsistent refutation system. Logic and Logical Philosophy. Online. 15 August 2009. Vol. 18, no. 1, pp. 65-70. [Accessed 25 July 2024]. DOI 10.12775/LLP.2009.005.
Issue
Section
Articles
Stats
Number of views and downloads: 292
Number of citations: 0