Maximality and Refutability

Notre Dame Journal of Formal Logic 45 (2):65-72 (2004)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2010-08-24

Downloads
35 (#651,090)

6 months
9 (#502,853)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A refutation theory.Tomasz Skura - 2009 - Logica Universalis 3 (2):293-302.
The RM paraconsistent refutation system.Tomasz Skura - 2009 - Logic and Logical Philosophy 18 (1):65-70.
N-valued maximal paraconsistent matrices.Adam Trybus - 2019 - Journal of Applied Non-Classical Logics 29 (2):171-183.

Add more citations

References found in this work

On the theory of inconsistent formal systems.Newton C. A. Costa - 1972 - Recife,: Universidade Federal de Pernambuco, Instituto de Matemática.
On the theory of inconsistent formal systems.Newton C. A. da Costa - 1974 - Notre Dame Journal of Formal Logic 15 (4):497-510.
Refutation calculi for certain intermediate propositional logics.Tomasz Skura - 1992 - Notre Dame Journal of Formal Logic 33 (4):552-560.

View all 6 references / Add more references