Switch to: References

Add citations

You must login to add citations.
  1. Lyndon’s Interpolation Property for the Logic of Strict Implication.Narbe Aboolian & Majid Alizadeh - forthcoming - Logic Journal of the IGPL.
    The main result proves Lyndon’s and Craig’s interpolation properties for the logic of strict implication ${\textsf{F}}$, with a purely syntactical method. A cut-free G3-style sequent calculus $ {\textsf{GF}} $ and its single-succedent variant $ \textsf{GF}_{\textsf{s}} $ are introduced. $ {\textsf{GF}} $ can be extended to a G3-variant of the sequent calculus GBPC3 for Visser’s basic logic. Also a simple syntactic proof of known embedding result of $ {\textsf{F}} $ into $ {\textsf{K}} $ is provided. An extension of $ {\textsf{F}} $, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Counterfactual Logic and the Necessity of Mathematics.Samuel Elgin - manuscript
    This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from ‘If A (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Roads to Necessitarianism.Matthew Mandelkern & Daniel Rothschild - forthcoming - Journal of Philosophical Logic:1-8.
    We show that each of three natural sets of assumptions about the conditional entails necessitarianism: that anything possible is necessary.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • Axiomatic and Dual Systems for Constructive Necessity, a Formally Verified Equivalence.Lourdes del Carmen González-Huesca, Favio E. Miranda-Perea & P. Selene Linares-Arévalo - 2019 - Journal of Applied Non-Classical Logics 29 (3):255-287.
    We present a proof of the equivalence between two deductive systems for constructive necessity, namely an axiomatic characterisation inspired by Hakli and Negri's system of derivations from assumptions for modal logic , a Hilbert-style formalism designed to ensure the validity of the deduction theorem, and the judgmental reconstruction given by Pfenning and Davies by means of a natural deduction approach that makes a distinction between valid and true formulae, constructively. Both systems and the proof of their equivalence are formally verified (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logical Dual Concepts Based on Mathematical Morphology in Stratified Institutions: Applications to Spatial Reasoning.Marc Aiguier & Isabelle Bloch - 2019 - Journal of Applied Non-Classical Logics 29 (4):392-429.
    Several logical operators are defined as dual pairs, in different types of logics. Such dual pairs of operators also occur in other algebraic theories, such as mathematical morphology. Based on this observation, this paper proposes to define, at the abstract level of institutions, a pair of abstract dual and logical operators as morphological erosion and dilation. Standard quantifiers and modalities are then derived from these two abstract logical operators. These operators are studied both on sets of states and sets of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Update, Probability, Knowledge and Belief.Jan van Eijck & Bryan Renne - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 551-570.
    Download  
     
    Export citation  
     
    Bookmark  
  • Kripke Completeness Revisited.Sara Negri - 2009 - In Giuseppe Primiero (ed.), Acts of Knowledge: History, Philosophy and Logic. College Publications. pp. 233--266.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Proof Theory for Modal Logic.Sara Negri - 2011 - Philosophy Compass 6 (8):523-538.
    The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer perspective.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • The Context of Inference.Curtis Franks - 2018 - History and Philosophy of Logic 39 (4):365-395.
    There is an ambiguity in the concept of deductive validity that went unnoticed until the middle of the twentieth century. Sometimes an inference rule is called valid because its conclusion is a theorem whenever its premises are. But often something different is meant: The rule's conclusion follows from its premises even in the presence of other assumptions. In many logical environments, these two definitions pick out the same rules. But other environments are context-sensitive, and in these environments the second notion (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Church–Fitch Knowability Paradox in the Light of Structural Proof Theory.Paolo Maffezioli, Alberto Naibo & Sara Negri - 2012 - Synthese 190 (14):2677-2716.
    Anti-realist epistemic conceptions of truth imply what is called the knowability principle: All truths are possibly known. The principle can be formalized in a bimodal propositional logic, with an alethic modality ${\diamondsuit}$ and an epistemic modality ${\mathcal{K}}$, by the axiom scheme ${A \supset \diamondsuit \mathcal{K} A}$. The use of classical logic and minimal assumptions about the two modalities lead to the paradoxical conclusion that all truths are known, ${A \supset \mathcal{K} A}$. A Gentzen-style reconstruction of the Church–Fitch paradox is presented (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Basic Intuitionistic Conditional Logic.Yale Weiss - 2019 - Journal of Philosophical Logic 48 (3):447-469.
    Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK both worlds (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Proof Analysis for Lewis Counterfactuals.Sara Negri & Giorgio Sbardolini - 2016 - Review of Symbolic Logic 9 (1):44-75.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Provability Logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
    -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Propositional Superposition Logic.Athanassios Tzouvaras - 2018 - Logic Journal of the IGPL 26 (1):149-190.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Are Uniqueness and Deducibility of Identicals the Same?Alberto Naibo & Mattia Petrolo - 2015 - Theoria 81 (2):143-181.
    A comparison is given between two conditions used to define logical constants: Belnap's uniqueness and Hacking's deducibility of identicals. It is shown that, in spite of some surface similarities, there is a deep difference between them. On the one hand, deducibility of identicals turns out to be a weaker and less demanding condition than uniqueness. On the other hand, deducibility of identicals is shown to be more faithful to the inferentialist perspective, permitting definition of genuinely proof-theoretical concepts. This kind of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Multimodal Incompleteness Under Weak Negations.Juliana Bueno-Soler - 2013 - Logica Universalis 7 (1):21-31.
    This paper shows that some classes of multimodal paraconsistent logics endowed with weak forms of negation are incompletable with respect to Kripke semantics. The reach of such incompleteness is discussed, and we argue that this shortcoming, more than just a logical predicament, may be relevant for attempts to characterize quantum logics and to handle quantum information and quantum computation.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Proof‐Theoretic Account of the Miners Paradox.Ansten Klev - 2016 - Theoria 82 (4):351-369.
    By maintaining that a conditional sentence can be taken to express the validity of a rule of inference, we offer a solution to the Miners Paradox that leaves both modus ponens and disjunction elimination intact. The solution draws on Sundholm's recently proposed account of Fitch's Paradox.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reflecting Rules: A Note on Generalizing the Deduction Theorem.Gillman Payette - 2015 - Journal of Applied Logic 13 (3):188-196.
    The purpose of this brief note is to prove a limitative theorem for a generalization of the deduction theorem. I discuss the relationship between the deduction theorem and rules of inference. Often when the deduction theorem is claimed to fail, particularly in the case of normal modal logics, it is the result of a confusion over what the deduction theorem is trying to show. The classic deduction theorem is trying to show that all so-called ‘derivable rules’ can be encoded into (...)
    Download  
     
    Export citation  
     
    Bookmark