Switch to: References

Citations of:

Modal Logic

Bulletin of Symbolic Logic 8 (2):299-301 (2002)

Add citations

You must login to add citations.
  1. Polynomial ring calculus for modal logics: A new semantics and proof method for modalities: Polynomial ring calculus for modal logics.Juan C. Agudelo - 2011 - Review of Symbolic Logic 4 (1):150-170.
    A new proof style adequate for modal logics is defined from the polynomial ring calculus. The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra???Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S 5, and can be easily extended to other modal (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (2 other versions)A Common Frame for Formal Imagination.Joan Casas-Roma, M. Elena Rodríguez & Antonia Huertas - 2019 - Minds and Machines 29 (4):603-634.
    In this paper, we review three influential theories of imagination in order to understand how the dynamics of imagination acts could be modeled using formal languages. While reviewing them, we notice that they are not detailed enough to account for all the mechanisms involved in creating and developing imaginary worlds. We claim those theories could be further refined into what we call the Common Frame for Imagination Acts, which defines a framework that can be used to study the dynamics of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Logic of Observation and Belief Revision in Scientific Communities.Hanna Sofie van Lee & Sonja Smets - 2020 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 51 (2):243-266.
    Scientists collect evidence in order to confirm or falsify scientific theories. Unfortunately, scientific evidence may sometimes be false or deceiving and as a consequence lead individuals to believe in a false theory. By interaction between scientists, such false beliefs may spread through the entire community. There is currently a debate about the effect of various network configurations on the epistemic reliability of scientific communities. To contribute to this debate from a logical perspective, this paper introduces an epistemic logical framework of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Implicit and Explicit Stances in Logic.Johan van Benthem - 2019 - Journal of Philosophical Logic 48 (3):571-601.
    We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Sequent Calculi for Global Modal Consequence Relations.Minghui Ma & Jinsheng Chen - 2019 - Studia Logica 107 (4):613-637.
    The global consequence relation of a normal modal logic \ is formulated as a global sequent calculus which extends the local sequent theory of \ with global sequent rules. All global sequent calculi of normal modal logics admits global cut elimination. This property is utilized to show that decidability is preserved from the local to global sequent theories of any normal modal logic over \. The preservation of Craig interpolation property from local to global sequent theories of any normal modal (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Binding bound variables in epistemic contexts.Brian Rabern - 2021 - Inquiry: An Interdisciplinary Journal of Philosophy 64 (5-6):533-563.
    ABSTRACT Quine insisted that the satisfaction of an open modalised formula by an object depends on how that object is described. Kripke's ‘objectual’ interpretation of quantified modal logic, whereby variables are rigid, is commonly thought to avoid these Quinean worries. Yet there remain residual Quinean worries for epistemic modality. Theorists have recently been toying with assignment-shifting treatments of epistemic contexts. On such views an epistemic operator ends up binding all the variables in its scope. One might worry that this yields (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Frames for fusions of modal logics.Sławomir Kost - 2018 - Journal of Applied Non-Classical Logics 28 (1):1-19.
    Let us consider multimodal logics and. We assume that is characterised by a class of connected frames, and there exists an -frame with a so-called -starting point. Similarly, the logic is characterised by a class of connected frames, and there exists an -frame with a -starting point. Using isomorphic copies of the frames and, we construct a connected frame which characterises the fusion. The frame thus obtained has some useful properties. Among others, is countable if both and are countable, and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the expressive power of first-order modal logic with two-dimensional operators.Alexander W. Kocurek - 2018 - Synthese 195 (10):4373-4417.
    Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these extensions are often justified (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Dualities for modal N4-lattices.R. Jansana & U. Rivieccio - 2014 - Logic Journal of the IGPL 22 (4):608-637.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Local Goldblatt–Thomason theorem.Evgeny Zolin - 2015 - Logic Journal of the IGPL 23 (6):861-880.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Axiomatizing hybrid products.Katsuhiko Sano - 2010 - Journal of Applied Logic 8 (4):459-474.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Justification logics and hybrid logics.Melvin Fitting - 2010 - Journal of Applied Logic 8 (4):356-370.
    Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Towards a “Sophisticated” Model of Belief Dynamics. Part II: Belief Revision.Brian Hill - 2008 - Studia Logica 89 (3):291-323.
    In the companion paper (Towards a “sophisticated” model of belief dynamics. Part I), a general framework for realistic modelling of instantaneous states of belief and of the operations involving them was presented and motivated. In this paper, the framework is applied to the case of belief revision. A model of belief revision shall be obtained which, firstly, recovers the Gärdenfors postulates in a well-specified, natural yet simple class of particular circumstances; secondly, can accommodate iterated revisions, recovering several proposed revision operators (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Obligation, Free Choice, and the Logic of Weakest Permissions.Albert J. J. Anglberger, Nobert Gratzl & Olivier Roy - 2015 - Review of Symbolic Logic 8 (4):807-827.
    We introduce a new understanding of deontic modals that we callobligations as weakest permissions. We argue for its philosophical plausibility, study its expressive power in neighborhood models, provide a complete Hilbert-style axiom system for it and show that it can be extended and applied to practical norms in decision and game theory.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Logics and algebras for multiple players.Loes Olde Loohuis & Yde Venema - 2010 - Review of Symbolic Logic 3 (3):485-519.
    We study a generalization of the standard syntax and game-theoretic semantics of logic, which is based on a duality between two players, to a multiplayer setting. We define propositional and modal languages of multiplayer formulas, and provide them with a semantics involving a multiplayer game. Our focus is on the notion of equivalence between two formulas, which is defined by saying that two formulas are equivalent if under each valuation, the set of players with a winning strategy is the same (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Updating knowledge using subsets.Konstantinos Georgatos - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):427-441.
    Larry Moss and Rohit Parikh used subset semantics to characterize a family of logics for reasoning about knowledge. An important feature of their framework is that subsets always decrease based on the assumption that knowledge always increases. We drop this assumption and modify the semantics to account for logics of knowledge that handle arbitrary changes, that is, changes that do not necessarily result in knowledge increase, such as the update of our knowledge due to an action. We present a system (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Subspaces of $${\mathbb{Q}}$$ whose d-logics do not have the FMP.Guram Bezhanishvili & Joel Lucero-Bryan - 2012 - Archive for Mathematical Logic 51 (5-6):661-670.
    We show that subspaces of the space ${\mathbb{Q}}$ of rational numbers give rise to uncountably many d-logics over K4 without the finite model property.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Logic games: Not just tools, but models of interaction.Johan van Benthem - unknown
    This paper is based on tutorials on 'Logic and Games' at the 7th Asian Logic Conference in Hsi-Tou, Taiwan, 1999, and until 2002 in Siena, Stuttgart, Trento, Udine, and Utrecht. We present logic games as a topic per se, giving models for dynamic interaction between agents. First, we survey some basic logic games. Then we show how their common properties raise general issues of game structure and 'game logics'. Next, we review logic games in the light of general game logic. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Paraconsistent vagueness: a positive argument.Pablo Cobreros - 2011 - Synthese 183 (2):211-227.
    Paraconsistent approaches have received little attention in the literature on vagueness (at least compared to other proposals). The reason seems to be that many philosophers have found the idea that a contradiction might be true (or that a sentence and its negation might both be true) hard to swallow. Even advocates of paraconsistency on vagueness do not look very convinced when they consider this fact; since they seem to have spent more time arguing that paraconsistent theories are at least as (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • A dynamic logic of agency I: Stit, capabilities and powers.Andreas Herzig & Emiliano Lorini - 2010 - Journal of Logic, Language and Information 19 (1):89-121.
    The aim of this paper, is to provide a logical framework for reasoning about actions, agency, and powers of agents and coalitions in game-like multi-agent systems. First we define our basic Dynamic Logic of Agency ( ). Differently from other logics of individual and coalitional capability such as Alternating-time Temporal Logic (ATL) and Coalition Logic, in cooperation modalities for expressing powers of agents and coalitions are not primitive, but are defined from more basic dynamic logic operators of action and (historic) (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Memory and perfect recall in extensive games.Giacomo Bonanno - 2004 - Games and Economic Behavior 47 (2):237-256.
    The notion of perfect recall in extensive games was introduced by Kuhn (1953), who interpreted it as "equivalent to the assertion that each player is allowed by the rules of the game to remember everything he knew at previous moves and all of his choices at those moves''. We provide a characterization and axiomatization of perfect recall based on two notions of memory: (1) memory of past knowledge and (2) memory of past actions.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Impossible Worlds.Franz Berto & Mark Jago - 2013 - Oxford: Oxford University Press.
    We need to understand the impossible. Francesco Berto and Mark Jago start by considering what the concepts of meaning, information, knowledge, belief, fiction, conditionality, and counterfactual supposition have in common. They are all concepts which divide the world up more finely than logic does. Logically equivalent sentences may carry different meanings and information and may differ in how they're believed. Fictions can be inconsistent yet meaningful. We can suppose impossible things without collapsing into total incoherence. Yet for the leading philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • From Oughts to Goals: A Logic for Enkrasia.Dominik Klein & Alessandra Marra - 2020 - Studia Logica 108 (1):85-128.
    This paper focuses on the Enkratic principle of rationality, according to which rationality requires that if an agent sincerely and with conviction believes she ought to X, then X-ing is a goal in her plan. We analyze the logical structure of Enkrasia and its implications for deontic logic. To do so, we elaborate on the distinction between basic and derived oughts, and provide a multi-modal neighborhood logic with three characteristic operators: a non-normal operator for basic oughts, a non-normal operator for (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the Modal Logic of Jeffrey Conditionalization.Zalán Gyenis - 2018 - Logica Universalis 12 (3-4):351-374.
    We continue the investigations initiated in the recent papers where Bayes logics have been introduced to study the general laws of Bayesian belief revision. In Bayesian belief revision a Bayesian agent revises his prior belief by conditionalizing the prior on some evidence using the Bayes rule. In this paper we take the more general Jeffrey formula as a conditioning device and study the corresponding modal logics that we call Jeffrey logics, focusing mainly on the countable case. The containment relations among (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On neighbourhood product of some Horn axiomatizable logics.Andrey Kudinov - 2018 - Logic Journal of the IGPL 26 (3):316-338.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hybrid logics with Sahlqvist axioms.ten Cate Balder, Marx Maarten & Viana Petrúcio - 2005 - Logic Journal of the IGPL 13 (3):293-300.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • An Interpretation of McCall’s “Real Possible Worlds” and His Semantics for Counterfactuals.Alexandru Dragomir - 2016 - Symposion: Theoretical and Applied Inquiries in Philosophy and Social Sciences 3 (1):65-78.
    McCall (1984) offered a semantics of counterfactual conditionals based on “real possible worlds” that avoids using the vague notion of similarity between possible worlds. I will propose an interpretation of McCall’s counterfactuals in a formal framework based on Baltag-Moss-Solecki events and protocols. Moreover, I will argue that using this interpretation one can avoid an objection raised by Otte (1987).
    Download  
     
    Export citation  
     
    Bookmark  
  • The Central Question in Comparative Syntactic Metatheory.Geoffrey K. Pullum - 2013 - Mind and Language 28 (4):492-521.
    Two kinds of theoretical framework for syntax are encountered in current linguistics. One emerged from the mathematization of proof theory, and is referred to here as generative-enumerative syntax (GES). A less explored alternative stems from the semantic side of logic, and is here called model-theoretic syntax (MTS). I sketch the outlines of each, and give a capsule summary of some mathematical results pertaining to the latter. I then briefly survey some diverse types of evidence suggesting that in some ways MTS (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)Multi-Modal CTL: Completeness, Complexity, and an Application.Thomas Ågotnes, Wiebe Van der Hoek, Juan A. Rodríguez-Aguilar, Carles Sierra & Michael Wooldridge - 2009 - Studia Logica 92 (1):1 - 26.
    We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Querying linguistic trees.Catherine Lai & Steven Bird - 2010 - Journal of Logic, Language and Information 19 (1):53-73.
    Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic or prosodic in nature, and have a hierarchical structure. Query languages are used to select particular structures of interest, or to project out large slices of a corpus for external analysis. Existing languages suffer from a variety of problems in the areas of expressiveness, efficiency, and naturalness for linguistic query. We describe the domain of linguistic trees and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A proof–theoretic study of the correspondence of hybrid logic and classical logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
    In this paper, we show the equivalence between the provability of a proof system of basic hybrid logic and that of translated formulas of the classical predicate logic with equality and explicit substitution by a purely proof–theoretic method. Then we show the equivalence of two groups of proof systems of hybrid logic: the group of labelled deduction systems and the group of modal logic-based systems.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Basic propositional logic and the weak excluded middle.Majid Alizadeh & Mohammad Ardeshir - 2019 - Logic Journal of the IGPL 27 (3):371-383.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Coalgerbraic Lindströom Theorems.Alexander Kurz & Yde Venema - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 292-309.
    Download  
     
    Export citation  
     
    Bookmark  
  • Two Reformulations of the Verificationist Thesis in Epistemic Temporal Logic that Avoid Fitch’s Paradox.Alexandru Dragomir - 2014 - Romanian Journal of Analytic Philosophy 8 (1):44-62.
    1) We will begin by offering a short introduction to Epistemic Logic and presenting Fitch’s paradox in an epistemic‑modal logic. (2) Then, we will proceed to presenting three Epistemic Temporal logical frameworks creat‑ ed by Hoshi (2009) : TPAL (Temporal Public Announcement Logic), TAPAL (Temporal Arbitrary Public Announcement Logic) and TPAL+P ! (Temporal Public Announcement Logic with Labeled Past Operators). We will show how Hoshi stated the Verificationist Thesis in the language of TAPAL and analyze his argument on why this (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • When Do Some Things Form a Set?Simon Hewitt - 2015 - Philosophia Mathematica 23 (3):311-337.
    This paper raises the question under what circumstances a plurality forms a set, parallel to the Special Composition Question for mereology. The range of answers that have been proposed in the literature are surveyed and criticised. I argue that there is good reason to reject both the view that pluralities never form sets and the view that pluralities always form sets. Instead, we need to affirm restricted set formation. Casting doubt on the availability of any informative principle which will settle (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Solovay-Type Theorems for Circular Definitions.Shawn Standefer - 2015 - Review of Symbolic Logic 8 (3):467-487.
    We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our proof to (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Inquisitive dynamic epistemic logic.Ivano A. Ciardelli & Floris Roelofsen - 2015 - Synthese 192 (6):1643-1687.
    Information exchange can be seen as a dynamic process of raising and resolving issues. The goal of this paper is to provide a logical framework to model and reason about this process. We develop an inquisitive dynamic epistemic logic , which enriches the standard framework of dynamic epistemic logic , incorporating insights from recent work on inquisitive semantics. At a static level, IDEL does not only allow us to model the information available to a set of agents, like standard epistemic (...)
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.Michael Kaminski & Nissim Francez - 2014 - Studia Logica 102 (3):479-497.
    We show that the relational semantics of the Lambek calculus, both nonassociative and associative, is also sound and complete for its extension with classical propositional logic. Then, using filtrations, we obtain the finite model property for the nonassociative Lambek calculus extended with classical propositional logic.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A dynamic logic of agency II: Deterministic dla {\mathcal{dla}} , coalition logic, and game theory.Emiliano Lorini - 2010 - Journal of Logic, Language and Information 19 (3):327-351.
    We continue the work initiated in Herzig and Lorini (J Logic Lang Inform, in press) whose aim is to provide a minimalistic logical framework combining the expressiveness of dynamic logic in which actions are first-class citizens in the object language, with the expressiveness of logics of agency such as STIT and logics of group capabilities such as CL and ATL. We present a logic called ( Deterministic Dynamic logic of Agency ) which supports reasoning about actions and joint actions of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • What is a logic translation?Till Mossakowski, Răzvan Diaconescu & Andrzej Tarlecki - 2009 - Logica Universalis 3 (1):95-124.
    We study logic translations from an abstract perspective, without any commitment to the structure of sentences and the nature of logical entailment, which also means that we cover both proof- theoretic and model-theoretic entailment. We show how logic translations induce notions of logical expressiveness, consistency strength and sublogic, leading to an explanation of paradoxes that have been described in the literature. Connectives and quantifiers, although not present in the definition of logic and logic translation, can be recovered by their abstract (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Argument evaluation in multi-agent justification logics.Alfredo Burrieza & Antonio Yuste-Ginel - forthcoming - Logic Journal of the IGPL.
    Argument evaluation, one of the central problems in argumentation theory, consists in studying what makes an argument a good one. This paper proposes a formal approach to argument evaluation from the perspective of justification logic. We adopt a multi-agent setting, accepting the intuitive idea that arguments are always evaluated by someone. Two general restrictions are imposed on our analysis: non-deductive arguments are left out and the goal of argument evaluation is fixed: supporting a given proposition. Methodologically, our approach uses several (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A New Framework for Epistemic Logic.Yanjing Wang - 2017 - In Proceedings of TARK 2017. EPTCS. pp. 515-534.
    Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃x◻φ, e.g., knowing how to achieve φ roughly means that there exists a way such that you know that it is a way to ensure that φ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • "Knowing value" logic as a normal modal logic.Tao Gu & Yanjing Wang - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 362-381.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Not All Those Who Wander Are Lost: Dynamic Epistemic Reasoning in Navigation.Yanjing Wang & Yanjun Li - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 559-580.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A general framework for dynamic epistemic logic: towards canonical correspondences.Shota Motoura - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):50-89.
    We propose a general framework for dynamic epistemic logics. It consists of a generic language for DELs and a class of structures, called model transition systems, that describe model transformations in a static way. An MTS can be viewed as a two-layered Kripke model and consequently inherits standard concepts such as bisimulation and bounded morphism from the ordinary Kripke models. In the second half of this article we add the global operator to the language, which enables us to define the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Knowledge, belief, normality, and introspection.Dominik Klein, Olivier Roy & Norbert Gratzl - 2017 - Synthese:1-30.
    We study two logics of knowledge and belief stemming from the work of Stalnaker, omitting positive introspection for knowledge. The two systems are equivalent with positive introspection, but not without. We show that while the logic of beliefs remains unaffected by omitting introspection for knowledge in one system, it brings significant changes to the other. The resulting logic of belief is non-normal, and its complete axiomatization uses an infinite hierarchy of coherence constraints. We conclude by returning to the philosophical interpretation (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reasoning About Agent Types and the Hardest Logic Puzzle Ever.Fenrong Liu & Yanjing Wang - 2013 - Minds and Machines 23 (1):123-161.
    In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by Boolos (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)S5 knowledge without partitions.Dov Samet - 2010 - Synthese 172 (1):145 - 155.
    We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.
    Download  
     
    Export citation  
     
    Bookmark