Switch to: References

Add citations

You must login to add citations.
  1. A Modality Called ‘Negation’.Francesco Berto - 2015 - Mind 124 (495):761-793.
    I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, different specifications of the notion of world support different logical conducts for negations. The approach unifies in a philosophically motivated picture the following (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Logic or Reason?Penelope Rush - 2012 - Logic and Logical Philosophy 21 (2):127-163.
    This paper explores the question of what logic is not. It argues against the wide spread assumptions that logic is: a model of reason; a model of correct reason; the laws of thought, or indeed is related to reason at all such that the essential nature of the two are crucially or essentially co-illustrative. I note that due to such assumptions, our current understanding of the nature of logic itself is thoroughly entangled with the nature of reason. I show that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Paraconsistentist Approach to Chisholm's Paradox.Marcelo Esteban Coniglio & Newton Marques Peron - 2009 - Principia: An International Journal of Epistemology 13 (3):299-326.
    The Logics of Deontic (In)Consistency (LDI's) can be considered as the deontic counterpart of the paraconsistent logics known as Logics of Formal (In)Consistency. This paper introduces and studies new LDI's and other paraconsistent deontic logics with different properties: systems tolerant to contradictory obligations; systems in which contradictory obligations trivialize; and a bimodal paraconsistent deontic logic combining the features of previous systems. These logics are used to analyze the well-known Chisholm's paradox, taking profit of the fact that, besides contradictory obligations do (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Is Dialetheism an Idealism? The Russellian Fallacy and the Dialetheist’s Dilemma.Francesco Berto - 2007 - Dialectica 61 (2):235–263.
    In his famous work on vagueness, Russell named “fallacy of verbalism” the fallacy that consists in mistaking the properties of words for the properties of things. In this paper, I examine two (clusters of) mainstream paraconsistent logical theories – the non-adjunctive and relevant approaches –, and show that, if they are given a strongly paraconsistent or dialetheic reading, the charge of committing the Russellian Fallacy can be raised against them in a sophisticated way, by appealing to the intuitive reading of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.
    Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Automated correspondence analysis for the binary extensions of the logic of paradox.Yaroslav Petrukhin & Vasily Shangin - 2017 - Review of Symbolic Logic 10 (4):756-781.
    B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A Non-deterministic View on Non-classical Negations.Arnon Avron - 2005 - Studia Logica 80 (2-3):159-194.
    We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for “the false”) by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ+, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple semantics which is (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Computer-Aided Searching for a Tabular Many-Valued Discussive Logic—Matrices.Marcin Jukiewicz, Marek Nasieniewski, Yaroslav Petrukhin & Vasily Shangin - forthcoming - Logic Journal of the IGPL.
    In the paper, we tackle the matter of non-classical logics, in particular, paraconsistent ones, for which not every formula follows in general from inconsistent premisses. Our benchmark is Jaśkowski’s logic, modeled with the help of discussion. The second key origin of this paper is the matter of being tabular, i.e. being adequately expressible by finitely many finite matrices. We analyse Jaśkowski’s non-tabular discussive (discursive) logic $ \textbf {D}_{2}$, one of the first paraconsistent logics, from the perspective of a trivalent tabular (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Paraconsistency.Igor Urbas - 1990 - Studies in Soviet Thought 39 (3-4):343-354.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Why FDE might be too strong for Beall.Jonas R. B. Arenhart & Hitoshi Omori - 2024 - Asian Journal of Philosophy 3 (1):1-16.
    In his “The simple argument for subclassical logic,” Jc Beall advances an argument that led him to take FDE as the one true logic (the latter point is explicitly made clear in his “FDE as the One True Logic”). The aim of this article is to point out that if we follow Beall’s line of reasoning for endorsing FDE, there are at least two additional reasons to consider that FDE is too strong for Beall’s purposes. In fact, we claim that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Three Schools of Paraconsistency.Koji Tanaka - 2003 - Australasian Journal of Logic 1:28-42.
    A logic is said to be paraconsistent if it does not allow everything to follow from contradictory premises. There are several approaches to paraconsistency. This paper is concerned with several philosophical positions on paraconsistency. In particular, it concerns three ‘schools’ of paraconsistency: Australian, Belgian and Brazilian. The Belgian and Brazilian schools have raised some objections to the dialetheism of the Australian school. I argue that the Australian school of paraconsistency need not be closed down on the basis of the Belgian (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Paraconsistency.Igor Urbas - 1990 - Studies in East European Thought 39 (3-4):343-354.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • First order theory for literal‐paraconsistent and literal‐paracomplete matrices.Renato A. Lewin & Irene F. Mikenberg - 2010 - Mathematical Logic Quarterly 56 (4):425-433.
    In this paper a first order theory for the logics defined through literal paraconsistent-paracomplete matrices is developed. These logics are intended to model situations in which the ground level information may be contradictory or incomplete, but it is treated within a classical framework. This means that literal formulas, i.e. atomic formulas and their iterated negations, may behave poorly specially regarding their negations, but more complex formulas, i.e. formulas that include a binary connective are well behaved. This situation may and does (...)
    Download  
     
    Export citation  
     
    Bookmark