In this paper we look at two classic methods of deriving consequences from inconsistent premises: Rescher-Manor and Schotch-Jennings. The overall goal of the project is to confine the method of drawing consequences from inconsistent sets to those that do not require reference to any information outside of very general facts about the set of premises. Methods in belief revision often require imposing assumptions on premises, e.g., which are the important premises, how the premises relate in non-logical ways. Such assumptions enable (...) one to select a reasonable collection of formulas from all the formulas of the language. Basic versions of the classic methods only use logical relations between the premises. We compare and criticize each of the classic views with an eye to combining the views to get the most out of inconsistent premises. We do this in a way that will respect the theoretical grounding of each view while meeting our other restrictions. (shrink)

Some strategies to turn any logic into a paraconsistent system are examined. In the environment of universal logic, we show how to paraconsistentize logics at the abstract level using a transformation in the class of all abstract logics called paraconsistentization by consistent sets. Moreover, by means of the notions of paradeduction and paraconsequence we go on applying the process of changing a logic converting it into a paraconsistent system. We also examine how this transformation can be performed using multideductive abstract (...) logics. To conclude, the conceptual notion paraconsistent orbit of a logic is proposed. (shrink)

This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate mainly the case of three-valued systems exhibiting how non-explosive three-valued logics can be obtained from them.