Results 171 to 180 of about 2,727 (208)

Paraconsistency, Paracompleteness, and Valuations

2012
The authors present a propositional calculus in the operators \(\to\), \(\wedge\), \(\vee\), \(\neg\) that is paraconsistent in the sense that it may serve as the underlying logic of a theory that contains some contradictions without implying all formulas. Roughly speaking, the \(\to\), \(\wedge\), \(\vee\) fragment is strong, and the negation operator
Loparić, Andréa, da Costa, Newton C. A.   +1 more
openaire   +2 more sources

Interpreting philosophical interpretations of paraconsistency

Synthese, 2022
J. Arenhart
semanticscholar   +1 more source

The psychological aspects of paraconsistency

Synthese, 2021
K. Rudnicki
semanticscholar   +2 more sources

Paraconsistent logics and applications

4th International Workshop on Soft Computing Applications, 2010
In this expository paper we discuss some applications of paraconsistent annotated logics. They have the capability of manipulating concepts like fuzziness, inconsistency, and paracompleteness in a non-trivial manner. Such systems are new and they were discovered recently at the end of last century.
openaire   +1 more source

Liberating Paraconsistency from Contradiction

Logica Universalis, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Can Başkent, Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency, Springer International Publishing, Outstanding Contributions to Logic, Vol. 18, 2019, pp. 704+xi; ISBN 978-3-030-25367-7 (Softcover) 106.99 €, ISBN 978-3-030-25364-6 (Hardcover) 149.79 €.

Studia Logica: An International Journal for Symbolic Logic, 2022
Bożena Czernecka-Rej
semanticscholar   +1 more source

Foundations of Paraconsistent Resolution

Fundamenta Informaticae, 2006
An extended first-order predicate sequent calculus PLK with two kinds of negation is introduced as a basis of a new resolution calculus PRC (paraconsistent resolution calculus) for handling the property of paraconsistency. Herbrand theorem, completeness theorem (with respect to a classical-like semantics) and cut-elimination theorem are proved for PLK.
openaire   +2 more sources

Why Paraconsistent Logics?

2016
In this chapter, we briefly review paraconsistent logics which are closely related to the topics in this book. We give an exposition of their history and formal aspects. We also address the importance of applications of paraconsistent logics to engineering.
Seiki Akama, Newton C. A. da Costa
openaire   +1 more source

Some remarks on two seminal approaches to paraconsistency: Stanisław Jaśkowski and Newton da Costa

Studia Logica: An International Journal for Symbolic Logic
Abilio Rodrigues, M. Nasieniewski, R. Nicolás-Francisco   +2 more
semanticscholar   +1 more source

The Dynamics of Imperfect Reasoning: Change, Paraconsistency and Knowledge

Logica Universalis
Rafael Ongaratto
semanticscholar   +1 more source