Maximality and Refutability
Skura, Tom
Notre Dame J. Formal Logic, Tome 45 (2004) no. 1, p. 65-72 / Harvested from Project Euclid
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.
Publié le : 2004-04-14
Classification:  maximal propositional logics,  inference systems,  syntactic refutability,  disjunction property,  paraconsistency,  03B20,  03B22,  03B53,  03B55,  03B99
@article{1095386644,
     author = {Skura, Tom},
     title = {Maximality and Refutability},
     journal = {Notre Dame J. Formal Logic},
     volume = {45},
     number = {1},
     year = {2004},
     pages = { 65-72},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1095386644}
}
Skura, Tom. Maximality and Refutability. Notre Dame J. Formal Logic, Tome 45 (2004) no. 1, pp.  65-72. http://gdmltest.u-ga.fr/item/1095386644/