Proof Systems Combining Classical and Paraconsistent Negations
- 61 Downloads
New propositional and first-order paraconsistent logics (called L ω and FL ω , respectively) are introduced as Gentzen-type sequent calculi with classical and paraconsistent negations. The embedding theorems of L ω and FL ω into propositional (first-order, respectively) classical logic are shown, and the completeness theorems with respect to simple semantics for L ω and FL ω are proved. The cut-elimination theorems for L ω and FL ω are shown using both syntactical ways via the embedding theorems and semantical ways via the completeness theorems.
KeywordsParaconsistent negation sequent calculus cut-elimination completeness
Unable to display preview. Download preview PDF.
- 2.Anderson, A.R., and N.D. Belnap, Entailment: The logic of relevance and necessity, Vol. I, Princeton University Press, Princeton, NJ, 1975.Google Scholar
- 4.Belnap, N.D., ‘A useful four-valued logic’, in J. M. Dunn and G. Epstein (eds.), Modern Uses of Multiple-Valued Logic, Reidel, Dordrecht, 1977, pp. 5–37.Google Scholar
- 6.Gargov G. (1999) ‘Knowledge, uncertainty and ignorance in logic: bilattices and beyond’. Journal of Applied Non-Classical Logics 9: 195–283Google Scholar
- 7.Kamide N. (2004) ‘A relationship between Rauszer’s H-B logic and Nelson’s logic’. Bulletin of the Section of Logic 33(4): 237–249Google Scholar
- 9.Kamide N. (2005) ‘A cut-free system for 16-valued reasoning’. Bulletin of the Section of Logic 34(4): 213–226Google Scholar
- 13.Takeuti, G., Proof theory, North-Holland Pub. Co., 1975.Google Scholar
- 14.Wansing, H., ‘The logic of information structures’, Lecture Notes in Artificial Intelligence 681, Springer-Verlag, 1993, pp. 1–163.Google Scholar