Open Access
2004 Maximality and Refutability
Tom Skura
Notre Dame J. Formal Logic 45(2): 65-72 (2004). DOI: 10.1305/ndjfl/1095386644

Abstract

In this paper we study symmetric inference systems (that is, pairs of inference systems) as refutation systems characterizing maximal logics with certain properties. In particular, the method is applied to paraconsistent logics, which are natural examples of such logics.

Citation

Download Citation

Tom Skura. "Maximality and Refutability." Notre Dame J. Formal Logic 45 (2) 65 - 72, 2004. https://doi.org/10.1305/ndjfl/1095386644

Information

Published: 2004
First available in Project Euclid: 16 September 2004

zbMATH: 1088.03010
MathSciNet: MR2130800
Digital Object Identifier: 10.1305/ndjfl/1095386644

Subjects:
Primary: 03B20 , 03B22 , 03B53 , 03B55 , 03B99

Keywords: disjunction property , inference systems , maximal propositional logics , paraconsistency , syntactic refutability

Rights: Copyright © 2004 University of Notre Dame

Vol.45 • No. 2 • 2004
Back to Top