Results for 'Kripke frame'

999 found
Order:
  1.  50
    Kripke Frame with Graded Accessibility and Fuzzy Possible World Semantics.Nobu-Yuki Suzuki - 1997 - Studia Logica 59 (2):249-269.
    A possible world structure consist of a set W of possible worlds and an accessibility relation R. We take a partial function r(·,·) to the unit interval [0, 1] instead of R and obtain a Kripke frame with graded accessibility r Intuitively, r(x, y) can be regarded as the reliability factor of y from x We deal with multimodal logics corresponding to Kripke frames with graded accessibility in a fairly general setting. This setting provides us with a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  2.  31
    Kripke Incompleteness of Predicate Extensions of the Modal Logics Axiomatized by a Canonical Formula for a Frame with a Nontrivial Cluster.Tatsuya Shimura - 2000 - Studia Logica 65 (2):237-247.
    We generalize the incompleteness proof of the modal predicate logic Q-S4+ p p + BF described in Hughes-Cresswell [6]. As a corollary, we show that, for every subframe logic Lcontaining S4, Kripke completeness of Q-L+ BF implies the finite embedding property of L.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  40
    Some Results on Kripke Models Over an Arbitrary Fixed Frame.Seyed Mohammad Bagheri & Morteza Moniri - 2003 - Mathematical Logic Quarterly 49 (5):479-484.
    We study the relations of being substructure and elementary substructure between Kripke models of intuitionistic predicate logic with the same arbitrary frame. We prove analogues of Tarski's test and Löwenheim-Skolem's theorems as determined by our definitions. The relations between corresponding worlds of two Kripke models [MATHEMATICAL SCRIPT CAPITAL K] ⪯ [MATHEMATICAL SCRIPT CAPITAL K]′ are studied.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  4.  13
    Linear Kripke Frames and Gödel Logics.Arnold Beckmann & Norbert Preining - 2007 - Journal of Symbolic Logic 72 (1):26 - 44.
    We investigate the relation between intermediate predicate logics based on countable linear Kripke frames with constant domains and Gödel logics. We show that for any such Kripke frame there is a Gödel logic which coincides with the logic defined by this Kripke frame on constant domains and vice versa. This allows us to transfer several recent results on Gödel logics to logics based on countable linear Kripke frames with constant domains: We obtain a complete (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  5.  33
    Some Results on the Kripke Sheaf Semantics for Super-Intuitionistic Predicate Logics.Nobu-Yuki Suzuki - 1993 - Studia Logica 52 (1):73 - 94.
    Some properties of Kripke-sheaf semantics for super-intuitionistic predicate logics are shown. The concept ofp-morphisms between Kripke sheaves is introduced. It is shown that if there exists ap-morphism from a Kripke sheaf 1 into 2 then the logic characterized by 1 is contained in the logic characterized by 2. Examples of Kripke-sheaf complete and finitely axiomatizable super-intuitionistic (and intermediate) predicate logics each of which is Kripke-frame incomplete are given. A correction to the author's previous paper (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  7
    Canonical Extensions and Kripke–Galois Semantics for Non-Distributive Logics.Chrysafis Hartonas - 2018 - Logica Universalis 12 (3-4):397-422.
    This article presents an approach to the semantics of non-distributive propositional logics that is based on a lattice representation theorem that delivers a canonical extension of the lattice. Our approach supports both a plain Kripke-style semantics and, by restriction, a general frame semantics. Unlike the framework of generalized Kripke frames, the semantic approach presented in this article is suitable for modeling applied logics, as it respects the intended interpretation of the logical operators. This is made possible by (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  22
    Preservation Theorems for Kripke Models.Morteza Moniri & Mostafa Zaare - 2009 - Mathematical Logic Quarterly 55 (2):177-184.
    There are several ways for defining the notion submodel for Kripke models of intuitionistic first-order logic. In our approach a Kripke model A is a submodel of a Kripke model B if they have the same frame and for each two corresponding worlds Aα and Bα of them, Aα is a subset of Bα and forcing of atomic formulas with parameters in the smaller one, in A and B, are the same. In this case, B is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  70
    Kripke on Necessity : A Metaphysical Investigation.Kyriakos Theodoridis - unknown
    I undertake a metaphysical investigation of Saul Kripke's modern classic, Naming and Necessity . The general problem of my study may be expressed as follows: What is the metaphysical justification of the validity and existence of the pertinent classes of truths, the necessary a posteriori and the contingent a priori, according to the Kripke Paradigm? My approach is meant to disclose the logical and ontological principles underlying Kripke's arguments for the necessary a posteriori and the contingent a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  46
    Matching Topological and Frame Products of Modal Logics.Philip Kremer - 2016 - Studia Logica 104 (3):487-502.
    The simplest combination of unimodal logics \ into a bimodal logic is their fusion, \, axiomatized by the theorems of \. Shehtman introduced combinations that are not only bimodal, but two-dimensional: he defined 2-d Cartesian products of 1-d Kripke frames, using these Cartesian products to define the frame product \. Van Benthem, Bezhanishvili, ten Cate and Sarenac generalized Shehtman’s idea and introduced the topological product \, using Cartesian products of topological spaces rather than of Kripke frames. (...) products have been extensively studied, but much less is known about topological products. The goal of the current paper is to give necessary and sufficient conditions for the topological product to match the frame product, for Kripke complete extensions of \. (shrink)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Cover Schemes, Frame-Valued Sets and Their Potential Uses in Spacetime Physics.John Bell - manuscript
    In the present paper the concept of a covering is presented and developed. The relationship between cover schemes, frames (complete Heyting algebras), Kripke models, and frame-valued set theory is discussed. Finally cover schemes and framevalued set theory are applied in the context of Markopoulou’s account of discrete spacetime as sets “evolving” over a causal set. We observe that Markopoulou’s proposal may be effectively realized by working within an appropriate frame-valued model of set theory. We go on to (...)
     
    Export citation  
     
    Bookmark   1 citation  
  11.  13
    Topological-Frame Products of Modal Logics.Philip Kremer - 2018 - Studia Logica 106 (6):1097-1122.
    The simplest bimodal combination of unimodal logics \ and \ is their fusion, \, axiomatized by the theorems of \ for \ and of \ for \, and the rules of modus ponens, necessitation for \ and for \, and substitution. Shehtman introduced the frame product \, as the logic of the products of certain Kripke frames: these logics are two-dimensional as well as bimodal. Van Benthem, Bezhanishvili, ten Cate and Sarenac transposed Shehtman’s idea to the topological semantics (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  21
    An Axiomatization of the Modal Theory of the Veiled Recession Frame.W. J. Blok - 1979 - Studia Logica 38 (1):37 - 47.
    The veiled recession frame has served several times in the literature to provide examples of modal logics failing to have certain desirable properties. Makinson [4] was the first to use it in his presentation of a modal logic without the finite model property. Thomason [5] constructed a (rather complicated) logic whose Kripke frames have an accessibility relation which is reflexive and transitive, but which is satisfied by the (non-transitive) veiled recession frame, and hence incomplete. In Van Benthem (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  13.  22
    Quantificational Modal Logic with Sequential Kripke Semantics.Stefano Borgo - 2005 - Journal of Applied Non-Classical Logics 15 (2):137-188.
    We introduce quantificational modal operators as dynamic modalities with Henkin quantifiers as indices. The adoption of matrices of indices gives an expressive formalism which is here motivated with examples from the area of multi-agent systems. We study the formal properties of the resulting logic which, formally speaking, does not satisfy the normality condition. However, the logic admits a semantics in terms of Kripke structures. As a consequence, standard techniques for normal modal logic become available. We apply these to prove (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14. I—Columnar Higher-Order Vagueness, or Vagueness is Higher-Order Vagueness.Susanne Bobzien - 2015 - Aristotelian Society Supplementary Volume 89 (1):61-87.
    Most descriptions of higher-order vagueness in terms of traditional modal logic generate so-called higher-order vagueness paradoxes. The one that doesn't is problematic otherwise. Consequently, the present trend is toward more complex, non-standard theories. However, there is no need for this.In this paper I introduce a theory of higher-order vagueness that is paradox-free and can be expressed in the first-order extension of a normal modal system that is complete with respect to single-domain Kripke-frame semantics. This is the system QS4M+BF+FIN. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  15.  39
    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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  16.  8
    Minimal Axiomatization in Modal Logic.Fabio Bellissima & Saverio Cittadini - 1997 - Mathematical Logic Quarterly 43 (1):92-102.
    We consider the problem of finding, in the ambit of modal logic, a minimal characterization for finite Kripke frames, i.e., a formula which, given a frame, axiomatizes its theory employing the lowest possible number of variables and implies the other axiomatizations. We show that every finite transitive frame admits a minimal characterization over K4, and that this result can not be extended to K.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  17.  8
    On the Modal Logic of Subset and Superset: Tense Logic Over Medvedev Frames.Wesley Holliday - 2017 - Studia Logica 105 (1):13-35.
    Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle W,R\rangle$ (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  5
    All Finitely Axiomatizable Normal Extensions of K4.3 Are Decidable.Michael Zakharyaschevm & Alexander Alekseev - 1995 - Mathematical Logic Quarterly 41 (1):15-23.
    We use the apparatus of the canonical formulas introduced by Zakharyaschev [10] to prove that all finitely axiomatizable normal modal logics containing K4.3 are decidable, though possibly not characterized by classes of finite frames. Our method is purely frame-theoretic. Roughly, given a normal logic L above K4.3, we enumerate effectively a class of frames with respect to which L is complete, show how to check effectively whether a frame in the class validates a given formula, and then apply (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  19.  7
    A Modal Framework For Modelling Abductive Reasoning.Fernando Soler-Toscano, David Fernández=Duque & Ángel Nepomuceno-fernández - 2012 - Logic Journal of the IGPL 20 (2):438-444.
    We present a framework for understanding abduction within modal logic and Kripke semantics; worlds of a Kripke frame will represent possible theories, and a change in theory will be understood as a passage from one world to an adjacent possible world. Further, these steps may agree with the accessibility relation or may ‘backtrack’, accordingly as new information refutes or reinforces our present theory. Our formalism can be used to model not only abduction, but also to talk about (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  20.  17
    The Finite Model Property for Logics with the Tangle Modality.Robert Goldblatt & Ian Hodkinson - 2018 - Studia Logica 106 (1):131-166.
    The tangle modality is a propositional connective that extends basic modal logic to a language that is expressively equivalent over certain classes of finite frames to the bisimulation-invariant fragments of both first-order and monadic second-order logic. This paper axiomatises several logics with tangle, including some that have the universal modality, and shows that they have the finite model property for Kripke frame semantics. The logics are specified by a variety of conditions on their validating frames, including local and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  21.  27
    On the Finite Model Property of Intuitionistic Modal Logics Over MIPC.Takahito Aoto & Hiroyuki Shirasu - 1999 - Mathematical Logic Quarterly 45 (4):435-448.
    MIPC is a well-known intuitionistic modal logic of Prior and Bull . It is shown that every normal intuitionistic modal logic L over MIPC has the finite model property whenever L is Kripke-complete and universal.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  4
    The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2014 - Journal of Philosophical Logic 43 (1):133-152.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23.  12
    Completeness in Equational Hybrid Propositional Type Theory.Maria Manzano, Manuel Martins & Antonia Huertas - 2019 - Studia Logica 107 (6):1159-1198.
    Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, The completeness of the first-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  2
    On the Inadequacy of the Relational Semantic for the “Until” Operator.Fabio Bellissima & Alessandra Ciupi - 1992 - Mathematical Logic Quarterly 38 (1):247-252.
    Modal logics with the binary operator Until are considered. It is shown that there exists a continuum of consistent U-logics without Kripke frames, and that each U-logic whose class of order does not have the finite frame property.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  28
    Decidability of Logics Based on an Indeterministic Metric Tense Logic.Yan Zhang & Kai Li - 2015 - Studia Logica 103 (6):1123-1162.
    This paper presents two general results of decidability concerning logics based on an indeterministic metric tense logic, which can be applied to, among others, logics combining knowledge, time and agency. We provide a general Kripke semantics based on a variation of the notion of synchronized Ockhamist frames. Our proof of the decidability is by way of the finite frame property, applying subframe transformations and a variant of the filtration technique.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  4
    Completeness in Equational Hybrid Propositional Type Theory.Maria Manzano, Manuel Martins & Antonia Huertas - 2019 - Studia Logica 107 (6):1159-1198.
    Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, The completeness of the first-order (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27.  10
    Invariant Logics.Marcus Kracht - 2002 - Mathematical Logic Quarterly 48 (1):29-50.
    A moda logic Λ is called invariant if for all automorphisms α of NExt K, α = Λ. An invariant ogic is therefore unique y determined by its surrounding in the attice. It wi be established among other that a extensions of K.alt1S4.3 and G.3 are invariant ogics. Apart from the results that are being obtained, this work contributes to the understanding of the combinatorics of finite frames in genera, something wich has not been done except for transitive frames. Certain (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  28.  56
    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.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  24
    Subdirectly Irreducible Modal Algebras and Initial Frames.Sambin Giovanni - 1999 - Studia Logica 62 (2):269-282.
    The duality between general frames and modal algebras allows to transfer a problem about the relational (Kripke) semantics into algebraic terms, and conversely. We here deal with the conjecture: the modal algebra A is subdirectly irreducible (s.i.) if and only if the dual frame A* is generated. We show that it is false in general, and that it becomes true under some mild assumptions, which include the finite case and the case of K4. We also prove that a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  8
    Dynamic Topological Completeness For.David Fernandez Duque - 2007 - Logic Journal of the IGPL 15 (1):77-107.
    Dynamic topological logic combines topological and temporal modalities to express asymptotic properties of dynamic systems on topological spaces. A dynamic topological model is a triple 〈X ,f , V 〉, where X is a topological space, f : X → X a continuous function and V a truth valuation assigning subsets of X to propositional variables. Valid formulas are those that are true in every model, independently of X or f. A natural problem that arises is to identify the logics (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  29
    Labelled Modal Logics: Quantifiers. [REVIEW]David Basin, Seán Matthews & Luca Viganò - 1998 - Journal of Logic, Language and Information 7 (3):237-263.
    In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4.2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to both properties of the accessibility relation in the Kripke frame and the way domains of individuals change (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  32.  12
    On Completeness of Intermediate Predicate Logics with Respect to {K}Ripke Semantics.T. Shimura - 1995 - Bulletin of the Section of Logic 24:41-45.
    In spite of the existence of many examples of incomplete logics, it is an important problem to find intermediate predicate logics complete with respect to Kripke frame (or Kripke sheaf) semantics because they are closed under substitution. But, most of known completeness proofs of finitely axiomatizable logics are difficult to apply to other logics since they are highly dependent on the specific properties of given logics. So, it is preferable to find a general methods of completeness proof. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  30
    Undecidability of First-Order Intuitionistic and Modal Logics with Two Variables.Roman Kontchakov, Agi Kurucz & Michael Zakharyaschev - 2005 - Bulletin of Symbolic Logic 11 (3):428-438.
    We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the two-variable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of practically all standard modal logics like K, K4, GL, S4, S5, K4.1, S4.2, GL.3, etc.). For many quantified modal logics, (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  45
    Model Checking for Hybrid Logic.Martin Lange - 2009 - Journal of Logic, Language and Information 18 (4):465-491.
    We consider the model checking problem for Hybrid Logic. Known algorithms so far are global in the sense that they compute, inductively, in every step the set of all worlds of a Kripke structure that satisfy a subformula of the input. Hence, they always exploit the entire structure. Local model checking tries to avoid this by only traversing necessary parts of the input in order to establish or refute the satisfaction relation between a given world and a formula. We (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35.  22
    Propositional Quantification in the Topological Semantics for S.Philip Kremer - 1997 - Notre Dame Journal of Formal Logic 38 (2):295-313.
    Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems , , : given a Kripke frame, the quantifiers range over all the sets of possible worlds. is decidable and, as Fine and Kripke showed, many of the other systems are recursively isomorphic to second-order logic. In the present paper I consider the propositionally quantified system that arises from the topological semantics for S4, rather than from the Kripke semantics. The topological (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  46
    Logics for Classes of Boolean Monoids.Gerard Allwein, Hilmi Demir & Lee Pike - 2004 - Journal of Logic, Language and Information 13 (3):241-266.
    This paper presents the algebraic and Kripke modelsoundness and completeness ofa logic over Boolean monoids. An additional axiom added to thelogic will cause the resulting monoid models to be representable as monoidsof relations. A star operator, interpreted as reflexive, transitiveclosure, is conservatively added to the logic. The star operator isa relative modal operator, i.e., one that is defined in terms ofanother modal operator. A further example, relative possibility,of this type of operator is given. A separate axiom,antilogism, added to the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Completeness and Correspondence in Chellas–Segerberg Semantics.Matthias Unterhuber & Gerhard Schurz - 2014 - Studia Logica 102 (4):891-911.
    We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  38.  17
    Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property.Guido Bertolotti, Pierangelo Miglioli & Daniela Silvestrini - 1996 - Mathematical Logic Quarterly 42 (1):501-536.
    We provide results allowing to state, by the simple inspection of suitable classes of posets , that the corresponding intermediate propositional logics are maximal among the ones which satisfy the disjunction property. Starting from these results, we directly exhibit, without using the axiom of choice, the Kripke frames semantics of 2No maximal intermediate propositional logics with the disjunction property. This improves previous evaluations, giving rise to the same conclusion but made with an essential use of the axiom of choice, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  39.  20
    The Modal Logic of Affine Planes is Not Finitely Axiomatisable.Ian Hodkinson & Altaf Hussain - 2008 - Journal of Symbolic Logic 73 (3):940-952.
    We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke frame with two sorts (points and lines) and three modal accessibility relations, namely the point-line and line-point incidence relations and the parallelism relation between lines. We show that the modal logic of affine planes in this language is not finitely axiomatisable.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  40.  24
    Modal Logic Without Contraction in a Metatheory Without Contraction.Patrick Girard & Zach Weber - 2019 - Review of Symbolic Logic 12 (4):685-701.
    Standard reasoning about Kripke semantics for modal logic is almost always based on a background framework of classical logic. Can proofs for familiar definability theorems be carried out using a nonclassical substructural logic as the metatheory? This article presents a semantics for positive substructural modal logic and studies the connection between frame conditions and formulas, via definability theorems. The novelty is that all the proofs are carried out with a noncontractive logic in the background. This sheds light on (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  86
    Prolegomena to Dynamic Logic for Belief Revision.Hans P. Van Ditmarsch - 2005 - Synthese 147 (2):229-275.
    In ‘belief revision’ a theory is revised with a formula φ resulting in a revised theory . Typically, is in , one has to give up belief in by a process of retraction, and φ is in . We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory wherein the agent believes the negation of the revision formula, i.e., wherein is true. The revision (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   44 citations  
  42.  4
    Axiomatization of Crisp Gödel Modal Logic.Ricardo Oscar Rodriguez & Amanda Vidal - forthcoming - Studia Logica:1-29.
    In this paper we consider the modal logic with both \ and \ arising from Kripke models with a crisp accessibility and whose propositions are valued over the standard Gödel algebra \. We provide an axiomatic system extending the one from Caicedo and Rodriguez :37–55, 2015) for models with a valued accessibility with Dunn axiom from positive modal logics, and show it is strongly complete with respect to the intended semantics. The axiomatizations of the most usual frame restrictions (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  30
    Logical Consecutions in Discrete Linear Temporal Logic.V. V. Rybakov - 2005 - Journal of Symbolic Logic 70 (4):1137 - 1149.
    We investigate logical consequence in temporal logics in terms of logical consecutions. i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be 'correct' in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈L, ≤, ≥〉 of all integer numbers, is the prime object of our (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  44.  79
    Elementary Canonical Formulae: Extending Sahlqvist’s Theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
    We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  45.  88
    Pure Extensions, Proof Rules, and Hybrid Axiomatics.Patrick Blackburn & Balder Ten Cate - 2006 - Studia Logica 84 (2):277-322.
    In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language to the strong Priorean language . We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  46.  11
    Prolegomena to Dynamic Logic for Belief Revision.Hans P. Van Ditmarsch - 2005 - Synthese 147 (2):229-275.
    In ‘belief revision’ a theory\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document} is revised with a formula φ resulting in a revised theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}\ast\varphi$$\end{document}. Typically, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document}, one has to give up belief in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} by a process (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  47.  26
    Modeling the concept of truth using the largest intrinsic fixed point of the strong Kleene three valued semantics (in Croatian language).Boris Culina - 2004 - Dissertation, University of Zagreb
    The thesis deals with the concept of truth and the paradoxes of truth. Philosophical theories usually consider the concept of truth from a wider perspective. They are concerned with questions such as - Is there any connection between the truth and the world? And, if there is - What is the nature of the connection? Contrary to these theories, this analysis is of a logical nature. It deals with the internal semantic structure of language, the mutual semantic connection of sentences, (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  48.  7
    Tableaux for Constructive Concurrent Dynamic Logic.Duminda Wijesekera & Anil Nerode - 2005 - Annals of Pure and Applied Logic 135 (1-3):1-72.
    This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  49.  83
    Reasoning About Collectively Accepted Group Beliefs.Raul Hakli & Sara Negri - 2011 - Journal of Philosophical Logic 40 (4):531-555.
    A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or legislators. Completeness with (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  50.  66
    Propositional Quantification in Bimodal S5.Peter Fritz - 2020 - Erkenntnis 85 (2):455-465.
    Propositional quantifiers are added to a propositional modal language with two modal operators. The resulting language is interpreted over so-called products of Kripke frames whose accessibility relations are equivalence relations, letting propositional quantifiers range over the powerset of the set of worlds of the frame. It is first shown that full second-order logic can be recursively embedded in the resulting logic, which entails that the two logics are recursively isomorphic. The embedding is then extended to all sublogics containing (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 999