Switch to: Citations

Add references

You must login to add references.
  1. On axiomatizations of public announcement logic.Yanjing Wang & Qinxiang Cao - 2013 - Synthese 190 (S1).
    In the literature, different axiomatizations of Public Announcement Logic (PAL) have been proposed. Most of these axiomatizations share a “core set” of the so-called “reduction axioms”. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules. In fact, many of the intuitive axioms and rules we took for granted could not be derived from the (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Aristotle's logic of statements about contingency.A. P. Brogan - 1967 - Mind 76 (301):49-61.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Completeness and Definability in the Logic of Noncontingency.Evgeni E. Zolin - 1999 - Notre Dame Journal of Formal Logic 40 (4):533-547.
    Hilbert-style axiomatic systems are presented for versions of the modal logics K, where {D, 4, 5}, with noncontingency as the sole modal primitive. The classes of frames characterized by the axioms of these systems are shown to be first-order definable, though not equal to the classes of serial, transitive, or euclidean frames. The canonical frame of the noncontingency logic of any logic containing the seriality axiom is proved to be nonserial. It is also shown that any class of frames definable (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Minimal Non-contingency Logic.Steven T. Kuhn - 1995 - Notre Dame Journal of Formal Logic 36 (2):230-234.
    Simple finite axiomatizations are given for versions of the modal logics K and K4 with non-contingency (or contingency) as the sole modal primitive. This answers two questions of I. L. Humberstone.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • 'Knowable' as 'known after an announcement'.Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch, Andreas Herzig, Tomohiro Hoshi & Tiago de Lima - 2008 - Review of Symbolic Logic 1 (3):305-334.
    Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Question-embedding and factivity.Paul Egré - 2008 - Grazer Philosophische Studien 77 (1):85-125.
    Attitude verbs fall in different categories depending on the kind of sentential complements which they can embed. In English, a verb like know takes both declarative and interrogative complements. By contrast, believe takes only declarative complements and wonder takes only interrogative complements. The present paper examines the hypothesis, originally put forward by Hintikka (1975), that the only verbs that can take both that -complements and whether -complements are the factive verbs. I argue that at least one half of the hypothesis (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Comments to 'logics of public communications'.Hans P. van Ditmarsch - 2007 - Synthese 158 (2):181-187.
    Take your average publication on the dynamics of knowledge. In one of its first paragraphs you will probably encounter a phrase like “a logic of public announcements was first proposed by Plaza in 1989 (Plaza 1989).” Tracking down this publication seems easy, because googling its title ‘Logics of Public Communications’ takes you straight to Jan Plaza’s website where it is online available in the author’s own version, including, on that page, very helpful and full bibliographic references to the proceedings in (...)
    Download  
     
    Export citation  
     
    Bookmark   2 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  
  • A Note on Logics of Ignorance and Borders.Christopher Steinsvold - 2008 - Notre Dame Journal of Formal Logic 49 (4):385-392.
    We present and show topological completeness for LB, the logic of the topological border. LB is also a logic of epistemic ignorance. Also, we present and show completeness for LUT, the logic of unknown truths. A simple topological completeness proof for S4 is also presented using a T1 space.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • A completeness proof for a logic with an alternative necessity operator.Stéphane Demri - 1997 - Studia Logica 58 (1):99-112.
    We show the completeness of a Hilbert-style system LK defined by M. Valiev involving the knowledge operator K dedicated to the reasoning with incomplete information. The completeness proof uses a variant of Makinson's canonical model construction. Furthermore we prove that the theoremhood problem for LK is co-NP-complete, using techniques similar to those used to prove that the satisfiability problem for propositional S5 is NP-complete.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Logic of Non-contingency.I. L. Humberstone - 1995 - Notre Dame Journal of Formal Logic 36 (2):214-229.
    We consider the modal logic of non-contingency in a general setting, without making special assumptions about the accessibility relation. The basic logic in this setting is axiomatized, and some of its extensions are discussed, with special attention to the expressive weakness of the language whose sole modal primitive is non-contingency , by comparison with the usual language based on necessity.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Contingency and non-contingency bases for normal modal logics.Hugh Montgomery & Richard Routley - 1966 - Logique Et Analyse 9 (35):318.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Knowing whether A or B.Maria Aloni, Paul Égré & Tikitu de Jager - 2013 - Synthese 190 (14):2595-2621.
    The paper examines the logic and semantics of knowledge attributions of the form “s knows whether A or B”. We analyze these constructions in an epistemic logic with alternative questions, and propose an account of the context-sensitivity of the corresponding sentences and of their presuppositions.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Knowledge transmissibility and pluralistic ignorance: A first stab.Vincent F. Hendricks - 2010 - Metaphilosophy 41 (3):279-291.
    Abstract: Pluralistic ignorance is a nasty informational phenomenon widely studied in social psychology and theoretical economics. It revolves around conditions under which it is "legitimate" for everyone to remain ignorant. In formal epistemology there is enough machinery to model and resolve situations in which pluralistic ignorance may arise. Here is a simple first stab at recovering from pluralistic ignorance by means of knowledge transmissibility.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Modal Logic of Agreement and Noncontingency.Lloyd Humberstone - 2002 - Notre Dame Journal of Formal Logic 43 (2):95-127.
    The formula A (it is noncontingent whether A) is true at a point in a Kripke model just in case all points accessible to that point agree on the truth-value of A. We can think of -based modal logic as a special case of what we call the general modal logic of agreement, interpreted with the aid of models supporting a ternary relation, S, say, with OA (which we write instead of A to emphasize the generalization involved) true at a (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations