This book is the first in the field of paraconsistency to offer a comprehensive overview of the subject, including connections to other logics and applications in information processing, linguistics, reasoning and argumentation, and philosophy of science. It is recommended reading for anyone interested in the question of reasoning and argumentation in the presence of contradictions, in semantics, in the paradoxes of set theory and in the puzzling properties of negation in logic programming. Paraconsistent logic comprises a major logical theory and (...) offers the broadest possible perspective on the debate of negation in logic and philosophy. It is a powerful tool for reasoning under contradictoriness as it investigates logic systems in which contradictory information does not lead to arbitrary conclusions. Reasoning under contradictions constitutes one of most important and creative achievements in contemporary logic, with deep roots in philosophical questions involving negation and consistency This book offers an invaluable introduction to a topic of central importance in logic and philosophy. It discusses the history of paraconsistent logic; language, negation, contradiction, consistency and inconsistency; logics of formal inconsistency and the main paraconsistent propositional systems; many-valued companions, possible-translations semantics and non-deterministic semantics; paraconsistent modal logics; first-order paraconsistent logics; applications to information processing, databases and quantum computation; and applications to deontic paradoxes, connections to Eastern thought and to dialogical reasoning. (shrink)

This paper presents Rasiowa–Sikorski deduction systems for logics \, \, \ and \. For each of the logics two systems are developed: an R–S system that can be supplemented with admissible cut rule, and a \-version of R–S system in which the non-admissible rule of cut is the only branching rule. The systems are presented in a Smullyan-like uniform notation, extended and adjusted to the aims of this paper. Completeness is proved by the use of abstract refutability properties which are (...) dual to consistency properties used by Fitting. Also the notion of admissibility of a rule in an R–S-system is analysed. (shrink)