•  71
    Idempotent Full Paraconsistent Negations are not Algebraizable
    Notre Dame Journal of Formal Logic 39 (1): 135-139. 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 which can be algebraized by a technique similar to the Tarski-Lindenbaum technique.
  • A Logical Analysis Of Singular Terms
    Sorites 10 6-14. 1999.
    We analyse the behaviour of definite descriptions and proper names terms in mathematical logic. We show that in formal arithmetic, wether some axioms are fixed or not, proper names cannot be considered rigid designators and have the same behaviour as definite descriptions. In set theory, sometimes two names for the same object are introduced. It seems that this can be explained by the notion of meaning. The meaning of such proper names can be considered as fuzzy sets of equivalent co-designative…Read more