What is it about?
This paper investigates the question of the semantic characterization of first-order LFIs (logics of formal inconsistency) by means of two-valued semantics. The method proposed here is completely general for this kind of logics, and can be easily extended to a large family of quantified paraconsistent logics.This paper shows how some subtletities involv
Featured Image
Why is it important?
This paper investigates the question of the semantic characterization of LFIs (logics of formal inconsistency) are powerful paraconsistent logics that encode classical logic, and permit a finer distinction between contradictions and inconsistencies. This kind of logic has found many applications Computer Science, Data Basis, Knowledge Engineering, as well as in the Foundations of Mathematics and Philosophy of Science.
Read the Original
This page is a summary of: ON THE WAY TO A WIDER MODEL THEORY: COMPLETENESS THEOREMS FOR FIRST-ORDER LOGICS OF FORMAL INCONSISTENCY, The Review of Symbolic Logic, June 2014, Cambridge University Press,
DOI: 10.1017/s1755020314000148.
You can read the full text:
Resources
Paraconsistent set theory by predicating on consistency
This paper establishes the basis for new paraconsistent set-theories (such as ZFmbC and ZFCil) under this perspective and establish their non-triviality, provided that ZF is consistent. By recalling how George Cantor himself, in his efforts towards founding set theory more than a century ago, not only used a form of ‘inconsistent sets’ in his mathematical reasoning, but regarded contradictions as beneficial, we argue that Cantor's handling of inconsistent collections can be related to ours.
Paraconsistent set theory by predicating on consistency
This paper establishes the basis for new paraconsistent set-theories (such as ZFmbC and ZFCil) under this perspective and establish their non-triviality, provided that ZF is consistent. By recalling how George Cantor himself, in his efforts towards founding set theory more than a century ago, not only used a form of ‘inconsistent sets’ in his mathematical reasoning, but regarded contradictions as beneficial, we argue that Cantor's handling of inconsistent collections can be related to ours.
Paraconsistent set theory by predicating on consistency
This paper establishes the basis for new paraconsistent set-theories (such as ZFmbC and ZFCil) under this perspective and establish their non-triviality, provided that ZF is consistent. By recalling how George Cantor himself, in his efforts towards founding set theory more than a century ago, not only used a form of ‘inconsistent sets’ in his mathematical reasoning, but regarded contradictions as beneficial, we argue that Cantor's handling of inconsistent collections can be related to ours.
Contributors
The following have contributed to this page
