Switch to: References

Citations of:

Modal Logic

Oxford University Press (1997)

Add citations

You must login to add citations.
  1. 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  
  • Deciding Regular Grammar Logics with Converse Through First-Order Logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
    We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar logics with (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Labelled Tree Sequents, Tree Hypersequents and Nested Sequents.Rajeev Goré & Revantha Ramanayake - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 279-299.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Catalog ofWeak Many-Valued Modal Axioms and Their Corresponding Frame Classes.Costas D. Koutras - 2003 - Journal of Applied Non-Classical Logics 13 (1):47-71.
    In this paper we provide frame definability results for weak versions of classical modal axioms that can be expressed in Fitting's many-valued modal languages. These languages were introduced by M. Fitting in the early '90s and are built on Heyting algebras which serve as the space of truth values. The possible-worlds frames interpreting these languages are directed graphs whose edges are labelled with an element of the underlying Heyting algebra, providing us a form of many-valued accessibility relation. Weak axioms of (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Hereditarily Structurally Complete Superintuitionistic Deductive Systems.Alex Citkin - 2018 - Studia Logica 106 (4):827-856.
    Propositional logic is understood as a set of theorems defined by a deductive system: a set of axioms and a set of rules. Superintuitionistic logic is a logic extending intuitionistic propositional logic \. A rule is admissible for a logic if any substitution that makes each premise a theorem, makes the conclusion a theorem too. A deductive system \ is structurally complete if any rule admissible for the logic defined by \ is derivable in \. It is known that any (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Fatal Heyting Algebras and Forcing Persistent Sentences.Leo Esakia & Benedikt Löwe - 2012 - Studia Logica 100 (1-2):163-173.
    Hamkins and Löwe proved that the modal logic of forcing is S4.2 . In this paper, we consider its modal companion, the intermediate logic KC and relate it to the fatal Heyting algebra H ZFC of forcing persistent sentences. This Heyting algebra is equationally generic for the class of fatal Heyting algebras. Motivated by these results, we further analyse the class of fatal Heyting algebras.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Frege Systems for Extensible Modal Logics.Emil Jeřábek - 2006 - Annals of Pure and Applied Logic 142 (1):366-379.
    By a well-known result of Cook and Reckhow [S.A. Cook, R.A. Reckhow, The relative efficiency of propositional proof systems, Journal of Symbolic Logic 44 36–50; R.A. Reckhow, On the lengths of proofs in the propositional calculus, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1976], all Frege systems for the classical propositional calculus are polynomially equivalent. Mints and Kojevnikov [G. Mints, A. Kojevnikov, Intuitionistic Frege systems are polynomially equivalent, Zapiski Nauchnyh Seminarov POMI 316 129–146] have recently shown p-equivalence of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Possible-Worlds Semantics for Modal Notions Conceived as Predicates.Volker Halbach, Hannes Leitgeb & Philip Welch - 2003 - Journal of Philosophical Logic 32 (2):179-223.
    If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Does the Deduction Theorem Fail for Modal Logic?Raul Hakli & Sara Negri - 2012 - Synthese 187 (3):849-867.
    Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Contra-Classical Logics.Lloyd Humberstone - 2000 - Australasian Journal of Philosophy 78 (4):438 – 474.
    Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Algorithmic Correspondence and Completeness in Modal Logic. IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Complexity of Intuitionistic Propositional Logic and its Fragments.Mikhail Rybakov - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):267-292.
    In the paper we consider complexity of intuitionistic propositional logic and its natural fragments such as implicative fragment, finite-variable fragments, and some others. Most facts we mention here are known and obtained by logicians from different countries and in different time since 1920s; we present these results together to see the whole picture.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Label-Free Natural Deduction Systems for Intuitionistic and Classical Modal Logics.Didier Galmiche & Yakoub Salhi - 2010 - Journal of Applied Non-Classical Logics 20 (4):373-421.
    In this paper we study natural deduction for the intuitionistic and classical modal logics obtained from the combinations of the axioms T, B, 4 and 5. In this context we introduce a new multi-contextual structure, called T-sequent, that allows to design simple labelfree natural deduction systems for these logics. After proving that they are sound and complete we show that they satisfy the normalization property and consequently the subformula property in the intuitionistic case.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Knowledge Means ‘All’, Belief Means ‘Most’.Dimitris Askounis, Costas D. Koutras & Yorgos Zikos - 2016 - Journal of Applied Non-Classical Logics 26 (3):173-192.
    We introduce a bimodal epistemic logic intended to capture knowledge as truth in all epistemically alternative states and belief as a generalised ‘majority’ quantifier, interpreted as truth in most of the epistemically alternative states. This doxastic interpretation is of interest in knowledge-representation applications and it also holds an independent philosophical and technical appeal. The logic comprises an epistemic modal operator, a doxastic modal operator of consistent and complete belief and ‘bridge’ axioms which relate knowledge to belief. To capture the notion (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite Non-Deterministic Semantics for Some Modal Systems.Marcelo E. Coniglio, Luis Fariñas del Cerro & Newton M. Peron - 2015 - Journal of Applied Non-Classical Logics 25 (1):20-45.
    Trying to overcome Dugundji’s result on uncharacterisability of modal logics by finite logical matrices, Kearns and Ivlev proposed, independently, a characterisation of some modal systems by means of four-valued multivalued truth-functions , as an alternative to Kripke semantics. This constitutes an antecedent of the non-deterministic matrices introduced by Avron and Lev . In this paper we propose a reconstruction of Kearns’s and Ivlev’s results in a uniform way, obtaining an extension to another modal systems. The first part of the paper (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Conditional Excluded Middle in Systems of Consequential Implication.Claudio Pizzi & Timothy Williamson - 2005 - Journal of Philosophical Logic 34 (4):333-362.
    It is natural to ask under what conditions negating a conditional is equivalent to negating its consequent. Given a bivalent background logic, this is equivalent to asking about the conjunction of Conditional Excluded Middle and Weak Boethius' Thesis. In the system CI.0 of consequential implication, which is intertranslatable with the modal logic KT, WBT is a theorem, so it is natural to ask which instances of CEM are derivable. We also investigate the systems CIw and CI of consequential implication, corresponding (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On Axiomatizing Shramko-Wansing’s Logic.Sergei P. Odintsov - 2009 - Studia Logica 91 (3):407-428.
    This work treats the problem of axiomatizing the truth and falsity consequence relations, $ \vDash _t $ and $ \vDash _f $, determined via truth and falsity orderings on the trilattice SIXTEEN₃. The approach is based on a representation of SIXTEEN₃ as a twist-structure over the two-element Boolean algebra.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Possible Worlds in Use.Andrzej Indrzejczak - 2011 - Studia Logica 99 (1-3):229-248.
    The paper is a brief survey of the most important semantic constructions founded on the concept of possible world. It is impossible to capture in one short paper the whole variety of the problems connected with manifold applications of possible worlds. Hence, after a brief explanation of some philosophical matters I take a look at possible worlds from rather technical standpoint of logic and focus on the applications in formal semantics. In particular, I would like to focus on the fruitful (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • BK-Lattices. Algebraic Semantics for Belnapian Modal Logics.Sergei P. Odintsov & E. I. Latkin - 2012 - Studia Logica 100 (1-2):319-338.
    Earlier algebraic semantics for Belnapian modal logics were defined in terms of twist-structures over modal algebras. In this paper we introduce the class of BK -lattices, show that this class coincides with the abstract closure of the class of twist-structures, and it forms a variety. We prove that the lattice of subvarieties of the variety of BK -lattices is dually isomorphic to the lattice of extensions of Belnapian modal logic BK . Finally, we describe invariants determining a twist-structure over a (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some Metacomplete Relevant Modal Logics.Takahiro Seki - 2013 - Studia Logica 101 (5):1115-1141.
    A logic is called metacomplete if formulas that are true in a certain preferred interpretation of that logic are theorems in its metalogic. In the area of relevant logics, metacompleteness is used to prove primeness, consistency, the admissibility of γ and so on. This paper discusses metacompleteness and its applications to a wider class of modal logics based on contractionless relevant logics and their neighbours using Slaney’s metavaluational technique.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On Pretabular Logics in NExtK4 (Part I).Shan Du & Hongkui Kang - 2014 - Studia Logica 102 (3):499-523.
    This paper partly answers the question “what a frame may be exactly like when it characterizes a pretabular logic in NExtK4”. We prove the pretabularity crieria for the logics of finite depth in NExtK4. In order to find out the criteria, we create two useful concepts—“pointwise reduction” and “invariance under pointwise reductions”, which will remain important in dealing with the case of infinite depth.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Power of Belnap: Sequent Systems for SIXTEEN ₃. [REVIEW]Heinrich Wansing - 2010 - Journal of Philosophical Logic 39 (4):369 - 393.
    The trilattice SIXTEEN₃ is a natural generalization of the wellknown bilattice FOUR₂. Cut-free, sound and complete sequent calculi for truth entailment and falsity entailment in SIXTEEN₃, are presented.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Zolin and Pizzi: Defining Necessity From Noncontingency.Lloyd Humberstone - 2013 - Erkenntnis 78 (6):1275-1302.
    The point of the present paper is to draw attention to some interesting similarities, as well as differences, between the approaches to the logic of noncontingency of Evgeni Zolin and of Claudio Pizzi. Though neither of them refers to the work of the other, each is concerned with the definability of a (normally behaving, though not in general truth-implying) notion of necessity in terms of noncontingency, standard boolean connectives and additional but non-modal expressive resources. The notion of definability involved is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proof Analysis in Intermediate Logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1-2):71-92.
    Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than in the (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Natural Factors of the Medvedev Lattice Capturing IPC.Rutger Kuyper - 2014 - Archive for Mathematical Logic 53 (7-8):865-879.
    Skvortsova showed that there is a factor of the Medvedev lattice which captures intuitionistic propositional logic. However, her factor is unnatural in the sense that it is constructed in an ad hoc manner. We present a more natural example of such a factor. We also show that the theory of every non-trivial factor of the Medvedev lattice is contained in Jankov’s logic, the deductive closure of IPC plus the weak law of the excluded middle ¬p∨¬¬p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Projective Beth Property in Extensions of Grzegorczyk Logic.Larisa Maksimova - 2006 - Studia Logica 83 (1-3):365-391.
    All extensions of the modal Grzegorczyk logic Grz possessing projective Beth's property PB2 are described. It is proved that there are exactly 13 logics over Grz with PB2. All of them are finitely axiomatizable and have the finite model property. It is shown that PB2 is strongly decidable over Grz, i.e. there is an algorithm which, for any finite system Rul of additional axiom schemes and rules of inference, decides if the calculus Grz+Rul has the projective Beth property.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Modal Logic of Gödel Sentences.Hirohiko Kushida - 2010 - Journal of Philosophical Logic 39 (5):577 - 590.
    The modal logic of Gödel sentences, termed as GS, is introduced to analyze the logical properties of 'true but unprovable' sentences in formal arithmetic. The logic GS is, in a sense, dual to Grzegorczyk's Logic, where modality can be interpreted as 'true and provable'. As we show, GS and Grzegorczyk's Logic are, in fact, mutually embeddable. We prove Kripke completeness and arithmetical completeness for GS. GS is also an extended system of the logic of 'Essence and Accident' proposed by Marcos (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Axiomatizing Shramko-Wansing’s Logic.Sergei P. Odintsov - 2009 - Studia Logica 91 (3):407 - 428.
    This work treats the problem of axiomatizing the truth and falsity consequence relations, $ \vDash _t $ and $ \vDash _f $, determined via truth and falsity orderings on the trilattice SIXTEEN₃. The approach is based on a representation of SIXTEEN₃ as a twist-structure over the two-element Boolean algebra.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Standard Gödel Modal Logics.Xavier Caicedo & Ricardo O. Rodriguez - 2010 - Studia Logica 94 (2):189-214.
    We prove strong completeness of the □-version and the ◊-version of a Gödel modal logic based on Kripke models where propositions at each world and the accessibility relation are both infinitely valued in the standard Gödel algebra [0,1]. Some asymmetries are revealed: validity in the first logic is reducible to the class of frames having two-valued accessibility relation and this logic does not enjoy the finite model property, while validity in the second logic requires truly fuzzy accessibility relations and this (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Three Dual Ontologies.Chris Brink & Ingrid Rewitzky - 2002 - Journal of Philosophical Logic 31 (6):543-568.
    In this paper we give an example of intertranslatability between an ontology of individuals (nominalism), an ontology of properties (realism), and an ontology of facts (factualism). We demonstrate that these three ontologies are dual to each other, meaning that each ontology can be translated into, and recaptured from, each of the others. The aiin of the enterprise is to raise the possibility that, at least in some settings, there may be no need for considerations of ontological primacy. Whether the world (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
    Monomodal logic has exactly two maximally normal logics, which are also the only quasi-normal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maximally normal logics that are not valid in any Kripke frame, or even in any complete modal algebra. We also construct continuum many quasi-normal Post complete logics that are not normal. The set of extensions (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Inquisitive Logic.Ivano Ciardelli & Floris Roelofsen - 2011 - Journal of Philosophical Logic 40 (1):55-94.
    This paper investigates a generalized version of inquisitive semantics. A complete axiomatization of the associated logic is established, the connection with intuitionistic logic and several intermediate logics is explored, and the generalized version of inquisitive semantics is argued to have certain advantages over the system that was originally proposed by Groenendijk (2009) and Mascarenhas (2009).
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • An Intuitionistic Characterization of Classical Logic.Ming Hsiung - 2008 - Journal of Philosophical Logic 37 (4):299 - 317.
    By introducing the intensional mappings and their properties, we establish a new semantical approach of characterizing intermediate logics. First prove that this new approach provides a general method of characterizing and comparing logics without changing the semantical interpretation of implication connective. Then show that it is adequate to characterize all Kripke_complete intermediate logics by showing that each of these logics is sound and complete with respect to its (unique) ‘weakest characterization property’ of intensional mappings. In particular, we show that classical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • First-Order Expressivity for S5-Models: Modal Vs. Two-Sorted Languages.Holger Sturm & Frank Wolter - 2001 - Journal of Philosophical Logic 30 (6):571-591.
    Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Definability and Interpolation in Non-Classical Logics.Larisa Maksimova - 2006 - Studia Logica 82 (2):271-291.
    Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some Results on Modal Axiomatization and Definability for Topological Spaces.Guram Bezhanishvili, Leo Esakia & David Gabelaia - 2005 - Studia Logica 81 (3):325-355.
    We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Intermediate Logics and the de Jongh Property.Dick de Jongh, Rineke Verbrugge & Albert Visser - 2011 - Archive for Mathematical Logic 50 (1-2):197-213.
    We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Béziau's Translation Paradox.Lloyd Humberstone - 2005 - Theoria 71 (2):138-181.
    Jean-Yves Béziau (‘Classical Negation can be Expressed by One of its Halves’, Logic Journal of the IGPL 7 (1999), 145–151) has given an especially clear example of a phenomenon he considers a sufficiently puzzling to call the ‘paradox of translation’: the existence of pairs of logics, one logic being strictly weaker than another and yet such that the stronger logic can be embedded within it under a faithful translation. We elaborate on Béziau’s example, which concerns classical negation, as well as (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A Tableau Calculus for Propositional Intuitionistic Logic with a Refined Treatment of Nested Implications.Mauro Ferrari, Camillo Fiorentini & Guido Fiorino - 2009 - Journal of Applied Non-Classical Logics 19 (2):149-166.
    Since 1993, when Hudelmaier developed an O-space decision procedure for propositional Intuitionistic Logic, a lot of work has been done to improve the efficiency of the related proof-search algorithms. In this paper a tableau calculus using the signs T, F and F c with a new set of rules to treat signed formulas of the kind T → C) is provided. The main feature of the calculus is the reduction of both the non-determinism in proof-search and the width of proofs (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Admissible Bases Via Stable Canonical Rules.Nick Bezhanishvili, David Gabelaia, Silvio Ghilardi & Mamuka Jibladze - 2016 - Studia Logica 104 (2):317-341.
    We establish the dichotomy property for stable canonical multi-conclusion rules for IPC, K4, and S4. This yields an alternative proof of existence of explicit bases of admissible rules for these logics.
    Download  
     
    Export citation  
     
    Bookmark  
  • First-Order Logic in the Medvedev Lattice.Rutger Kuyper - 2015 - Studia Logica 103 (6):1185-1224.
    Kolmogorov introduced an informal calculus of problems in an attempt to provide a classical semantics for intuitionistic logic. This was later formalised by Medvedev and Muchnik as what has come to be called the Medvedev and Muchnik lattices. However, they only formalised this for propositional logic, while Kolmogorov also discussed the universal quantifier. We extend the work of Medvedev to first-order logic, using the notion of a first-order hyperdoctrine from categorical logic, to a structure which we will call the hyperdoctrine (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Modal Languages for Topology: Expressivity and Definability.Balder ten Cate, David Gabelaia & Dmitry Sustretov - 2009 - Annals of Pure and Applied Logic 159 (1-2):146-170.
    In this paper we study the expressive power and definability for modal languages interpreted on topological spaces. We provide topological analogues of the van Benthem characterization theorem and the Goldblatt–Thomason definability theorem in terms of the well-established first-order topological language.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • An Algebraic Approach to Canonical Formulas: Intuitionistic Case: An Algebraic Approach to Canonical Formulas.Guram Bezhanishvili - 2009 - Review of Symbolic Logic 2 (3):517-549.
    We introduce partial Esakia morphisms, well partial Esakia morphisms, and strong partial Esakia morphisms between Esakia spaces and show that they provide the dual description of homomorphisms, homomorphisms, and homomorphisms between Heyting algebras, thus establishing a generalization of Esakia duality. This yields an algebraic characterization of Zakharyaschev’s subreductions, cofinal subreductions, dense subreductions, and the closed domain condition. As a consequence, we obtain a new simplified proof of Zakharyaschev’s theorem that each intermediate logic can be axiomatized by canonical formulas.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The Modal Logic of Stone Spaces: Diamond as Derivative: Modal Logic of Stone Spaces.Guram Bezhanishvili - 2010 - Review of Symbolic Logic 3 (1):26-40.
    We show that if we interpret modal diamond as the derived set operator of a topological space, then the modal logic of Stone spaces is _K4_ and the modal logic of weakly scattered Stone spaces is _K4G_. As a corollary, we obtain that _K4_ is also the modal logic of compact Hausdorff spaces and _K4G_ is the modal logic of weakly scattered compact Hausdorff spaces.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Quasi-Lattice of Indiscernible Elements.Mauri Cunha do Nascimento, Décio Krause & Hércules Araújo Feitosa - 2011 - Studia Logica 97 (1):101-126.
    The literature on quantum logic emphasizes that the algebraic structures involved with orthodox quantum mechanics are non distributive. In this paper we develop a particular algebraic structure, the quasi-lattice (J-lattice), which can be modeled by an algebraic structure built in quasi-set theory Q. This structure is non distributive and involve indiscernible elements. Thus we show that in taking into account indiscernibility as a primitive concept, the quasi-lattice that 'naturally' arises is non distributive.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Dynamic Logics of the Region-Based Theory of Discrete Spaces.Philippe Balbiani, Tinko Tinchev & Dimiter Vakarelov - 2007 - Journal of Applied Non-Classical Logics 17 (1):39-61.
    The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discrete spaces. These modal logics are linguistic restrictions of propositional dynamic logic with the global diamond E. Their formulas are equivalent to Boolean combinations of modal formulas like E where A and B are Boolean terms and α is a relational term. Examining what we can say about dynamic models (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Embedding Logics in the Local Computation Framework.Nic Wilson & Jérôme Mengin - 2001 - Journal of Applied Non-Classical Logics 11 (3-4):239-267.
    The Local Computation Framework has been used to improve the efficiency of computation in various uncertainty formalisms. This paper shows how the framework can be used for the computation of logical deduction in two different ways; the first way involves embedding model structures in the framework; the second, and more direct, way involves embedding sets of formulae. This work can be applied to many of the logics developed for different kinds of reasoning, including predicate calculus, modal logics, possibilistic logics, probabilistic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Prior’s OIC Nonconservativity Example Revisited.Lloyd Humberstone - 2014 - Journal of Applied Non-Classical Logics 24 (3):209-235.
    In his 1964 note, ‘Two Additions to Positive Implication’, A. N. Prior showed that standard axioms governing conjunction yield a nonconservative extension of the pure implicational intermediate logic OIC of R. A. Bull. Here, after reviewing the situation with the aid of an adapted form of the Kripke semantics for intuitionistic and intermediate logics, we proceed to illuminate this example by transposing it to the setting of modal logic, and then relate it to the propositional logic of what have been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • « Everywhere » and « Here ».Valentin Shehtman - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):369-379.
    ABSTRACT The paper studies propositional logics in a bimodal language, in which the first modality is interpreted as the local truth, and the second as the universal truth. The logic S4UC is introduced, which is finitely axiomatizable, has the f.m.p. and is determined by every connected separable metric space.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation