Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)An infinity of super-Belnap logics.Umberto Rivieccio - 2012 - Journal of Applied Non-Classical Logics 22 (4):319-335.
    We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Subprevarieties Versus Extensions. Application to the Logic of Paradox.Alexej P. Pynko - 2000 - Journal of Symbolic Logic 65 (2):756-766.
    In the present paper we prove that the poset of all extensions of the logic defined by a class of matrices whose sets of distinguished values are equationally definable by their algebra reducts is the retract, under a Galois connection, of the poset of all subprevarieties of the prevariety generated by the class of the algebra reducts of the matrices involved. We apply this general result to the problem of finding and studying all extensions of the logic of paradox. In (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)An infinity of super-Belnap logics.Umberto Rivieccio - 2012 - Journal of Applied Non-Classical Logics 22 (4):319-335.
    We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new log- ics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • N-valued maximal paraconsistent matrices.Adam Trybus - 2019 - Journal of Applied Non-Classical Logics 29 (2):171-183.
    ABSTRACTThe articles Maximality and Refutability Skura [. Maximality and refutability. Notre Dame Journal of Formal Logic, 45, 65–72] and Three-valued Maximal Paraconsistent Logics Skura and Tuziak [. Three-valued maximal paraconsistent logics. In Logika. Wydawnictwo Uniwersytetu Wrocławskiego] introduced a simple method of proving maximality of a given paraconsistent matrix. This method stemmed from the so-called refutation calculus, where the focus in on rejecting rather than accepting formulas. The article A Generalisation of a Refutation-related Method in Paraconsistent Logics Trybus [. A generalisation (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Gentzen-Type Methods for Bilattice Negation.Norihiro Kamide - 2005 - Studia Logica 80 (2-3):265-289.
    A general Gentzen-style framework for handling both bilattice (or strong) negation and usual negation is introduced based on the characterization of negation by a modal-like operator. This framework is regarded as an extension, generalization or re- finement of not only bilattice logics and logics with strong negation, but also traditional logics including classical logic LK, classical modal logic S4 and classical linear logic CL. Cut-elimination theorems are proved for a variety of proposed sequent calculi including CLS (a conservative extension of (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On All Strong Kleene Generalizations of Classical Logic.Stefan Wintein - 2016 - Studia Logica 104 (3):503-545.
    By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • A Gentzen Calculus for Nothing but the Truth.Stefan Wintein & Reinhard Muskens - 2016 - Journal of Philosophical Logic 45 (4):451-465.
    In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus for (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A cut-free Gentzen calculus with subformula property for first-degree entailments in lc.Alexej P. Pynko - 2003 - Bulletin of the Section of Logic 32 (3):137-146.
    Download  
     
    Export citation  
     
    Bookmark  
  • Paraconsistent modal logics.Umberto Rivieccio - 2011 - Electronic Notes in Theoretical Computer Science 278:173-186.
    We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twiststructures, generalizing a known result on the representation of the algebraic counterpart of paraconsistent Nelson logic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Interpolation Methods for Dunn Logics and Their Extensions.Stefan Wintein & Reinhard Muskens - 2017 - Studia Logica 105 (6):1319-1347.
    The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An expansion of first-order Belnap-Dunn logic.K. Sano & H. Omori - 2014 - Logic Journal of the IGPL 22 (3):458-481.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Nelson algebras, residuated lattices and rough sets: A survey.Jouni Järvinen, Sándor Radeleczki & Umberto Rivieccio - 2024 - Journal of Applied Non-Classical Logics 34 (2):368-428.
    Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is currently lacking, and the theory of Nelson algebras remains largely unknown to most logicians. This paper aims to fill this gap by focussing on the essential developments in the field over the past two decades. Additionally, we explore generalisations of Nelson algebras, such as N4-lattices which (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • From Belnap-Dunn Four-Valued Logic to Six-Valued Logics of Evidence and Truth.Marcelo E. Coniglio & Abilio Rodrigues - 2024 - Studia Logica 112 (3):561-606.
    The main aim of this paper is to introduce the logics of evidence and truth $$LET_{K}^+$$ and $$LET_{F}^+$$ together with sound, complete, and decidable six-valued deterministic semantics for them. These logics extend the logics $$LET_{K}$$ and $$LET_{F}^-$$ with rules of propagation of classicality, which are inferences that express how the classicality operator $${\circ }$$ is transmitted from less complex to more complex sentences, and vice-versa. The six-valued semantics here proposed extends the 4 values of Belnap-Dunn logic with 2 more values (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Generalizing Functional Completeness in Belnap-Dunn Logic.Hitoshi Omori & Katsuhiko Sano - 2015 - Studia Logica 103 (5):883-917.
    One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn’s discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Subquasivarieties of implicative locally-finite quasivarieties.Alexej P. Pynko - 2010 - Mathematical Logic Quarterly 56 (6):643-658.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A relative interpolation theorem for infinitary universal Horn logic and its applications.Alexej P. Pynko - 2006 - Archive for Mathematical Logic 45 (3):267-305.
    In this paper we deal with infinitary universal Horn logic both with and without equality. First, we obtain a relative Lyndon-style interpolation theorem. Using this result, we prove a non-standard preservation theorem which contains, as a particular case, a Lyndon-style theorem on surjective homomorphisms in its Makkai-style formulation. Another consequence of the preservation theorem is a theorem on bimorphisms, which, in particular, provides a tool for immediate obtaining characterizations of infinitary universal Horn classes without equality from those with equality. From (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Bilattices with Implications.Félix Bou & Umberto Rivieccio - 2013 - Studia Logica 101 (4):651-675.
    In a previous work we studied, from the perspective ofAlgebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with additional implication (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Ivlev-Like Modal Logics of Formal Inconsistency Obtained by Fibring Swap Structures.Marcelo E. Coniglio - forthcoming - Studia Logica:1-70.
    The aim of this paper is to give the first steps towards the formal study of swap structures, which are non-deterministic matrices (Nmatrices) defined over tuples of 0–1 truth values generalizing the notion of twist structures. To do this, a precise notion of clauses which axiomatize bivaluation semantics is proposed. From this specification, a swap structure is naturally induced. This formalization allows to define the combination by fibring of two given logics described by swap structures generated by clauses in a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations.Alexej P. Pynko - 2020 - Bulletin of the Section of Logic 49 (4):401-437.
    Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique conjunctive matrix ℳ4 with exactly two distinguished values over an expansion.
    Download  
     
    Export citation  
     
    Bookmark  
  • Regular bilattices.Alexej P. Pynko - 2000 - Journal of Applied Non-Classical Logics 10 (1):93-111.
    ABSTRACT A bilattice is said to be regular provided its truth conjunction and disjunction are monotonic with respect to its knowledge ordering. The principal result of this paper is that the following properties of a bilattice B are equivalent: 1. B is regular; 2. the truth conjunction and disjunction of B are definable through the rest of the operations and constants of B; 3. B is isomorphic to a bilattice of the form L 1 · L 2 where L 1 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Many-place sequent calculi for finitely-valued logics.Alexej P. Pynko - 2010 - Logica Universalis 4 (1):41-66.
    In this paper, we study multiplicative extensions of propositional many-place sequent calculi for finitely-valued logics arising from those introduced in Sect. 5 of Pynko (J Multiple-Valued Logic Soft Comput 10:339–362, 2004) through their translation by means of singularity determinants for logics and restriction of the original many-place sequent language. Our generalized approach, first of all, covers, on a uniform formal basis, both the one developed in Sect. 5 of Pynko (J Multiple-Valued Logic Soft Comput 10:339–362, 2004) for singular finitely-valued logics (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Four-Valued Logics BD and DM4: Expansions.Alexander S. Karpenko - 2017 - Bulletin of the Section of Logic 46 (1/2).
    The paper discusses functional properties of some four-valued logics which are the expansions of four-valued Belnap’s logic DM4. At first, we consider the logics with two designated values, and then logics defined by matrices having the same underlying algebra, but with a different choice of designated values, i.e. with one designated value. In the preceding literature both approaches were developed independently. Moreover, we present the lattices of the functional expansions of DM4.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation.Dimiter Vakarelov - 2006 - Studia Logica 84 (1):105-127.
    The paper is devoted to the contributions of Helena Rasiowa to the theory of non-classical negation. The main results of Rasiowa in this area concerns–constructive logic with strong (Nelson) negation.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Distributive-lattice semantics of sequent calculi with structural rules.Alexej P. Pynko - 2009 - Logica Universalis 3 (1):59-94.
    The goal of the paper is to develop a universal semantic approach to derivable rules of propositional multiple-conclusion sequent calculi with structural rules, which explicitly involve not only atomic formulas, treated as metavariables for formulas, but also formula set variables, upon the basis of the conception of model introduced in :27–37, 2001). One of the main results of the paper is that any regular sequent calculus with structural rules has such class of sequent models that a rule is derivable in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Combining Swap Structures: The Case of Paradefinite Ivlev-Like Modal Logics Based on $$FDE$$.Marcelo E. Coniglio - forthcoming - Studia Logica:1-52.
    The aim of this paper is to combine several Ivlev-like modal systems characterized by 4-valued non-deterministic matrices (Nmatrices) with $$\mathcal {IDM}4$$, a 4-valued expansion of Belnap–Dunn’s logic $$FDE$$ with an implication introduced by Pynko in 1999. In order to do this, we introduce a new methodology for combining logics which are characterized by means of swap structures, based on what we call superposition of snapshots. In particular, the combination of $$\mathcal {IDM}4$$ with $$Tm$$, the 4-valued Ivlev’s version of KT, will (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On a Four-Valued Logic of Formal Inconsistency and Formal Undeterminedness.Marcelo E. Coniglio, G. T. Gomez–Pereira & Martín Figallo - forthcoming - Studia Logica:1-42.
    Belnap–Dunn’s relevance logic, \(\textsf{BD}\), was designed seeking a suitable logical device for dealing with multiple information sources which sometimes may provide inconsistent and/or incomplete pieces of information. \(\textsf{BD}\) is a four-valued logic which is both paraconsistent and paracomplete. On the other hand, De and Omori, while investigating what classical negation amounts to in a paracomplete and paraconsistent four-valued setting, proposed the expansion \(\textsf{BD2}\) of the four valued Belnap–Dunn logic by a classical negation. In this paper, we introduce a four-valued expansion (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation.Dimiter Vakarelov - 2005 - Studia Logica 80 (2):393-430.
    Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Definitional equivalence and algebraizability of generalized logical systems.Alexej P. Pynko - 1999 - Annals of Pure and Applied Logic 98 (1-3):1-68.
    In this paper we define and study a generalized notion of a logical system that covers on an equal formal basis sentential, equational and sequential systems. We develop a general theory of equivalence between generalized logics that provides, first, a conception of algebraizable logic , second, a formal concept of equivalence between sequential systems and, third, a notion of equivalence between sentential and sequential systems. We also use our theory of equivalence for developing a general algebraic approach to conjunctive non-pseudo-axiomatic (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations