Switch to: References

Add citations

You must login to add citations.
  1. On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
    In this paper we describe, in a purely algebraic language, truth-complete finite-valued propositional logical calculi extending the classical Boolean calculus. We also give a new proof of the Completeness Theorem for such calculi. We investigate the quasi-varieties of algebras playing an analogous role in the theory of these finite-valued logics to the role played by the variety of Boolean algebras in classical logic.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3.Aldo Figallo Orellano, Miguel Pérez-Gaspar & Everardo Bárcenas - forthcoming - Logic and Logical Philosophy:1-18.
    Paraconsistent extensions of 3-valued Gödel logic are studied as tools for knowledge representation and nonmonotonic reasoning. Particularly, Osorio and his collaborators showed that some of these logics can be used to express interesting nonmonotonic semantics. CG’3 is one of these 3-valued logics. In this paper, we introduce Fidel semantics for a certain calculus of CG’3 by means of Fidel structures, named CG’3-structures. These structures are constructed from enriched Boolean algebras with a special family of sets. Moreover, we also show that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On the way to a Wider model theory: Completeness theorems for first-order logics of formal inconsistency.Walter Carnielli, Marcelo E. Coniglio, Rodrigo Podiacki & Tarcísio Rodrigues - 2014 - Review of Symbolic Logic 7 (3):548-578.
    This paper investigates the question of characterizing first-order LFIs (logics of formal inconsistency) by means of two-valued semantics. LFIs are powerful paraconsistent logics that encode classical logic and permit a finer distinction between contradictions and inconsistencies, with a deep involvement in philosophical and foundational questions. Although focused on just one particular case, namely, the quantified logic QmbC, the method proposed here is completely general for this kind of logics, and can be easily extended to a large family of quantified paraconsistent (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • First-order swap structures semantics for some Logics of Formal Inconsistency.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - 2020 - Journal of Logic and Computation 30 (6):1257-1290.
    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations