What is “formal logic”? (2008)
The subject of formal logic when treated by the method of setting up a formalized language is called symbolic logic, or mathematical logic or logistic. Church, 1956, p.56. Many people understand the...
⋆ Component—Universal Logic = Rigid Logic + Flexible Logic = Formal Logic + Dialectical Logic (2008)
Jean-yves Béziau, Huacan He, Re Costa-leite, Yixin Zhong, Yingcang Ma, ...
www.uni-log.org www.uni-log.cn
Jean-yves Béziau, Jean-yves Béziau
In a first section, we discuss Quine’s claim according to which identity is a logical notion. We point out that Quine mixes up various types of identities: trivial (or diagonal) identity, Leibniz...
Contents 1. Logic of the future or logic without future? (2008)
2. Paraconsistent problems
Bivalence, Excluded Middle and Non Contradiction (2008)
« Ou il est faux, ou il est vrai, que ma femme me trompe, mais si le tiers n’est pas exclu, alors il se peut qu’il soit faux que ma femme me trompe et qu’elle ne me trompe pas, et dans ce cas,...
⋆ Component—Universal Logic = Rigid Logic + Flexible Logic = Formal Logic + Dialectical Logic (2008)
Jean-yves Béziau, Huacan He, Re Costa-leite, Yixin Zhong, Yingcang Ma, ...
www.uni-log.org www.uni-log.cn
New Light on the Square of Oppositions and its Nameless Corner (2008)
It has been pointed out that there is no primitive name in natural and formal languages for one corner of the famous square of oppositions. We have all, some and no, but no primitive name for not...
Lorenzo Peña, Jean-yves Béziau, Enrique Alonso, Guillermo Hurtado, Manuel Liz, Raymundo Morado, ...
σωριτης
Combining Conjunction with Disjunction (2005)
Jean-yves Béziau, Marcelo E. Coniglio
Abstract. In this paper we address some central problems of combination of logics through the study of a very simple but highly informative case, the combination of the logics of disjunction and...
www.elsevier.com/locate/jal Paraconsistent logic from a modal viewpoint ✩ (2004)
In this paper we study paraconsistent negation as a modal operator, considering the fact that the classical negation of necessity has a paraconsistent behavior. We examine this operator on the one...
What is paraconsistent logic (2000)
A possible solution to Jaśkowski’s problem ∗ Abstract. We present a paraconsistent logic, called Z, based on an intuitive possible worlds semantics, in which the replacement theorem holds. We...
A sequent calculus for Lukasiewicz's three-valued logic based on Suszko's bivalent semantics (1999)
A sequent calculus S3 for ̷Lukasiewicz’s logic L3 is presented. The completeness theorem is proved relatively to a bivalent semantics equivalent to the non truthfunctional bivalent semantics for...
Idempotent Full Paraconsistent Negations are not Algebraizable (1998)
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that $\neg(a\wedge\neg a)$ is a theorem...
Idempotent full paraconsistent negations are not algebrizable, Notre Dame (1998)
Abstract Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧¬a) is a theorem...
Aspects of Paraconsistent Logic (1995)
???? the abstract ???? Keywords: ??????? 1 Introduction During the last two decades, we have been witnessing a growing interest as well as a remarkable activity in connection to paraconsistent logic....