Switch to: References

Add citations

You must login to add citations.
  1. Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Modal Logic S4 as a Paraconsistent Logic with a Topological Semantics.Marcelo E. Coniglio & Leonardo Prieto-Sanabria - 2017 - In Carlos Caleiro, Francisco Dionisio, Paula Gouveia, Paulo Mateus & João Rasga (eds.), Logic and Computation: Essays in Honour of Amilcar Sernadas. London, UK: College Publications. pp. 171-196.
    In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a nice topological interpretation. This constitutes a new proof of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • The Philosophy of Alternative Logics.Andrew Aberdein & Stephen Read - 2009 - In Leila Haaparanta (ed.), The Development of Modern Logic. Oxford University Press. pp. 613-723.
    This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an especially detailed reform (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • The Genesis of Possible Worlds Semantics.B. Jack Copeland - 2002 - Journal of Philosophical Logic 31 (2):99-137.
    This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  • Kripke Completeness Revisited.Sara Negri - 2009 - In Giuseppe Primiero (ed.), Acts of Knowledge: History, Philosophy and Logic. College Publications. pp. 233--266.
  • Lattice Logic as a Fragment of Residuated Modal Logic.Chrysafis Hartonas - 2018 - Journal of Applied Non-Classical Logics 29 (2):152-170.
    ABSTRACTCorrespondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components,, and, then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests that (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Analogues of Bull’s Theorem for Hybrid Logic.Willem Conradie & Claudette Robinson - 2019 - Logic Journal of the IGPL 27 (3):281-313.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Almost Structural Completeness; an Algebraic Approach.Wojciech Dzik & Michał M. Stronkowski - 2016 - Annals of Pure and Applied Logic 167 (7):525-556.
  • Natural Factors of the Muchnik Lattice Capturing IPC.Rutger Kuyper - 2013 - Annals of Pure and Applied Logic 164 (10):1025-1036.
    We give natural examples of factors of the Muchnik lattice which capture intuitionistic propositional logic , arising from the concepts of lowness, 1-genericity, hyperimmune-freeness and computable traceability. This provides a purely computational semantics for IPC.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Intermediate Logics and Factors of the Medvedev Lattice.Andrea Sorbi & Sebastiaan A. Terwijn - 2008 - Annals of Pure and Applied Logic 155 (2):69-85.
    We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Mass Problems and Intuitionism.Stephen G. Simpson - 2008 - Notre Dame Journal of Formal Logic 49 (2):127-136.
    Let $\mathcal{P}_w$ be the lattice of Muchnik degrees of nonempty $\Pi^0_1$ subsets of $2^\omega$. The lattice $\mathcal{P}$ has been studied extensively in previous publications. In this note we prove that the lattice $\mathcal{P}$ is not Brouwerian.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤Ω.Richard Zach - 2004 - Journal of Philosophical Logic 33 (2):155-164.
    Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most ω, the resulting logics are decidable. (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark  
  • Frontiers of Conditional Logic.Yale Weiss - 2019 - Dissertation, The Graduate Center, City University of New York
    Conditional logics were originally developed for the purpose of modeling intuitively correct modes of reasoning involving conditional—especially counterfactual—expressions in natural language. While the debate over the logic of conditionals is as old as propositional logic, it was the development of worlds semantics for modal logic in the past century that catalyzed the rapid maturation of the field. Moreover, like modal logic, conditional logic has subsequently found a wide array of uses, from the traditional (e.g. counterfactuals) to the exotic (e.g. conditional (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Spatial Logic of Tangled Closure Operators and Modal Mu-Calculus.Robert Goldblatt & Ian Hodkinson - 2017 - Annals of Pure and Applied Logic 168 (5):1032-1090.
  • Foreword.Philippe Balbiani - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):317-318.
  • Continuity, Freeness, and Filtrations.Silvio Ghilardi - 2010 - Journal of Applied Non-Classical Logics 20 (3):193-217.
    The role played by continuous morphisms in propositional modal logic is investigated: it turns out that they are strictly related to filtrations and to suitable variants of the notion of a free algebra. We also employ continuous morphisms in incremental constructions of finitely generated free.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Defective Conditional in Mathematics.Mathieu Vidal - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):169-179.
    This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Modal Theorem-Preserving Translation of a Class of Three-Valued Logics of Incomplete Information.D. Ciucci & D. Dubois - 2013 - Journal of Applied Non-Classical Logics 23 (4):321-352.
    There are several three-valued logical systems that form a scattered landscape, even if all reasonable connectives in three-valued logics can be derived from a few of them. Most papers on this subject neglect the issue of the relevance of such logics in relation with the intended meaning of the third truth-value. Here, we focus on the case where the third truth-value means unknown, as suggested by Kleene. Under such an understanding, we show that any truth-qualified formula in a large range (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Strange Remark Attributed to Gödel.Lloyd Humberstone - 2003 - History and Philosophy of Logic 24 (1):39-44.
    We assemble material from the literature on matrix methodology for sentential logic?without claiming to present any new logical results?in order to show that Gödel once made (or at least, is quoted as having made) an uncharacteristically ill-considered remark in this area.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Modal Logics Between Propositional and First Order.Melvin Fitting - unknown
    One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if terms are allowed to be non-rigid, a scoping mechanism (usually written using lambda abstraction) must also be introduced to avoid ambiguity. Since quantifiers are not present, this is not really a first-order logic, but it is not exactly propositional either. For propositional logics such as K, T and D, adding such machinery produces (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   5 citations