65 found
Order:
Disambiguations
Hans van Ditmarsch [59]Hans P. van Ditmarsch [6]Hans van Ditmarsch [1]
  1. Dynamic Epistemic Logic.Hans van Ditmarsch, Wiebe van Der Hoek & Barteld Kooi - 2008 - Studia Logica 89 (3):441-445.
  2.  78
    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 with (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   43 citations  
  3.  88
    '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.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  4. Dynamic Epistemic Logic.Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi - 2016 - Internet Encyclopedia of Philosophy.
    Dynamic Epistemic Logic This article tells the story of the rise of dynamic epistemic logic, which began with epistemic logic, the logic of knowledge, in the 1960s. Then, in the late 1980s, came dynamic epistemic logic, the logic of change of knowledge. Much of it was motivated by puzzles and paradoxes. The number … Continue reading Dynamic Epistemic Logic →.
     
    Export citation  
     
    Bookmark   9 citations  
  5. The Secret of My Success.Hans Van Ditmarsch & Barteld Kooi - 2006 - Synthese 151 (2):201-232.
    In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  6.  96
    Hidden Protocols: Modifying Our Expectations in an Evolving World.Hans Van Ditmarsch, Sujata Ghosh, Rineke Verbrugge & Yanjing Wang - 2014 - Artificial Intelligence 208 (1):18--40.
    When agents know a protocol, this leads them to have expectations about future observations. Agents can update their knowledge by matching their actual observations with the expected ones. They eliminate states where they do not match. In this paper, we study how agents perceive protocols that are not commonly known, and propose a semantics-driven logical framework to reason about knowledge in such scenarios. In particular, we introduce the notion of epistemic expectation models and a propositional dynamic logic-style epistemic logic for (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  23
    Group Announcement Logic.Thomas Ågotnes, Philippe Balbiani, Hans van Ditmarsch & Pablo Seban - 2010 - Journal of Applied Logic 8 (1):62-81.
  8.  19
    Announcement as Effort on Topological Spaces.Hans van Ditmarsch, Sophia Knight & Aybüke Özgün - 2019 - Synthese 196 (7):2927-2969.
    We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  18
    Question–Answer Games.Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch & Stefan Minica - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):265-288.
    We propose strategic games wherein the strategies consist of players asking each other questions and answering those questions. We study simplifications of such games wherein two players simultaneously ask each other a question that the opponent is then obliged to answer. The motivation for our research is to model conversation including the dynamics of questions and answers, to provide new links between game theory and dynamic logics of information, and to exploit the dynamic/strategic structure that, we think, lies implicitly inside (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  10.  44
    Bisimulation and Expressivity for Conditional Belief, Degrees of Belief, and Safe Belief.Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch & Martin Holm Jensen - 2017 - Synthese 194 (7):2447-2487.
    Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe belief. With respect to these logics, plausibility models may contain too much information. A proper notion (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Semantic Results for Ontic and Epistemic Change. van Ditmarsch, Hans & Kooi, Barteld - unknown
    Hans van Ditmarsch and Barteld Kooi (2008). Semantic results for ontic and epistemic change. In: G. Bonanno, W. van der Hoek and M. Wooldridge (editors). Logic and the Foundations of Game and Decision Theory (LOFT 7). Texts in Logic and Games 3, pp. 87-117, Amsterdam University Press, Amsterdam.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark   9 citations  
  12. Introspective Forgetting.Hans van Ditmarsch, Andreas Herzig, Jérôme Lang & Pierre Marquis - 2009 - Synthese 169 (2):405-423.
    We model the forgetting of propositional variables in a modal logical context where agents become ignorant and are aware of each others’ or their own resulting ignorance. The resulting logic is sound and complete. It can be compared to variable-forgetting as abstraction from information, wherein agents become unaware of certain variables: by employing elementary results for bisimulation, it follows that beliefs not involving the forgotten atom(s) remain true.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  13.  40
    The Russian Cards Problem.Hans van Ditmarsch - 2003 - Studia Logica 75 (1):31-62.
    Suppose we have a stack of cards that is divided over some players. For certain distributions of cards it is possible to communicate your hand of cards to another player by public announcements, without yet another player learning any of your cards. A solution to this problem consists of some sequence of announcements and is called an exchange. It is called a direct exchange if it consists of (the minimum of) two announcements only. The announcements in an exchange have a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  14.  90
    Everything is Knowable – How to Get to Know Whether a Proposition is True.Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev - 2012 - Theoria 78 (2):93-114.
    Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we interpret ‘successful’ as (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  15. On the Logic of Lying.Hans van Ditmarsch, Jan van Eijck & Yanjing Wang - unknown
    We look at lying as an act of communication, where (i) the proposition that is communicated is not true, (ii) the utterer of the lie knows that what she communicates is not true, and (iii) the utterer of the lie intends the lie to be taken as truth. Rather than dwell on the moral issues, we provide a sketch of what goes on logically when a lie is communicated. We present a complete logic of manipulative updating, to analyse the effects (...)
     
    Export citation  
     
    Bookmark   6 citations  
  16.  11
    Private Announcements on Topological Spaces.Hans van Ditmarsch, Sophia Knight & Aybüke Özgün - 2018 - Studia Logica 106 (3):481-513.
    In this work, we present a multi-agent logic of knowledge and change of knowledge interpreted on topological structures. Our dynamics are of the so-called semi-private character where a group G of agents is informed of some piece of information \, while all the other agents observe that group G is informed, but are uncertain whether the information provided is \ or \. This article follows up on our prior work where the dynamics were public events. We provide a complete axiomatization (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  56
    What Will They Say?—Public Announcement Games.Hans van Ditmarsch & Thomas Ågotnes - 2011 - Synthese 179 (S1):57 - 85.
    Dynamic epistemic logic describes the possible information-changing actions available to individual agents, and their knowledge pre-and post conditions. For example, public announcement logic describes actions in the form of public, truthful announcements. However, little research so far has considered describing and analysing rational choice between such actions, i.e., predicting what rational self-interested agents actually will or should do. Since the outcome of information exchange ultimately depends on the actions chosen by all the agents in the system, and assuming that agents (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  61
    Dynamics of Lying.Hans van Ditmarsch - 2014 - Synthese 191 (5):1-33.
    We propose a dynamic logic of lying, wherein a ‘lie that $\varphi $ ’ (where $\varphi $ is a formula in the logic) is an action in the sense of dynamic modal logic, that is interpreted as a state transformer relative to the formula $\varphi $ . The states that are being transformed are pointed Kripke models encoding the uncertainty of agents about their beliefs. Lies can be about factual propositions but also about modal formulas, such as the beliefs of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19.  73
    My Beliefs About Your Beliefs: A Case Study in Theory of Mind and Epistemic Logic.Hans van Ditmarsch & Willem Labuschagne - 2007 - Synthese 155 (2):191-209.
    We model three examples of beliefs that agents may have about other agents’ beliefs, and provide motivation for this conceptualization from the theory of mind literature. We assume a modal logical framework for modelling degrees of belief by partially ordered preference relations. In this setting, we describe that agents believe that other agents do not distinguish among their beliefs (‘no preferences’), that agents believe that the beliefs of other agents are in part as their own (‘my preferences’), and the special (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  20.  13
    Dynamic Graded Epistemic Logic.Minghui Ma & Hans van Ditmarsch - 2019 - Review of Symbolic Logic 12 (4):663-684.
    Graded epistemic logic is a logic for reasoning about uncertainties. Graded epistemic logic is interpreted on graded models. These models are generalizations of Kripke models. We obtain completeness of some graded epistemic logics. We further develop dynamic extensions of graded epistemic logics, along the framework of dynamic epistemic logic. We give an extension with public announcements, i.e., public events, and an extension with graded event models, a generalization also including nonpublic events. We present complete axiomatizations for both logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  5
    Almost Mecessary.Jie Fan, Yanjing Wang & Hans van Ditmarsch - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 178-196.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  22.  4
    Some Exponential Lower Bounds on Formula-Size in Modal Logic.Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 139-157.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  23.  91
    Logic of Change, Change of Logic.Hans van Ditmarsch, Brian Hill & Ondrej Majer - 2009 - Synthese 171 (2):227 - 234.
  24.  16
    Propositional Quantification in Logics of Contingency.Hans van Ditmarsch & Jie Fan - 2016 - Journal of Applied Non-Classical Logics 26 (1):81-102.
    In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called arbitrary public announcement logic. However, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  5
    Some Truths Are Best Left Unsaid.Philippe Baldiani, Hans van Ditmarsch, Andreas Herzig & Tiago de Lima - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 36-54.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  30
    Descriptions of Game Actions.Hans P. van Ditmarsch - 2002 - Journal of Logic, Language and Information 11 (3):349-365.
    To describe simultaneous knowledge updates for different subgroups we propose anepistemic language with dynamic operators for actions. The language is interpreted onequivalence states (S5 states). The actions are interpreted as state transformers. Two crucial action constructors are learning and local choice. Learning isthe dynamic equivalent of common knowledge. Local choice aids in constraining theinterpretation of an action to a functional interpretation (state transformer).Bisimilarity is preserved under execution of actions. The language is applied todescribe various actions in card games.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27. One Hundred Prisoners and a Lightbulb — Logic and Computation.Hans van Ditmarsch & Jan van Eijck - unknown
    This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know, how their knowledge changes due to observations, and how they affect the state of the world by changing facts, i.e., by their actions. These actions depend on the history of previous actions and observations. Part of its interest is that all actions are local, i.e. not publicly observable, and part of the problem (...)
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  28. A Theoria Round Table on Philosophy Publishing.Bengt Hansson, Hans van Ditmarsch, Pascal Engel, Sven Ove Hansson, Vincent Hendricks, Søren Holm, Pauline Jacobson, Anthonie Meijers, Henry S. Richardson & Hans Rott - 2011 - Theoria 77 (2):104-116.
    As part of the conference commemorating Theoria's 75th anniversary, a round table discussion on philosophy publishing was held in Bergendal, Sollentuna, Sweden, on 1 October 2010. Bengt Hansson was the chair, and the other participants were eight editors-in-chief of philosophy journals: Hans van Ditmarsch (Journal of Philosophical Logic), Pascal Engel (Dialectica), Sven Ove Hansson (Theoria), Vincent Hendricks (Synthese), Søren Holm (Journal of Medical Ethics), Pauline Jacobson (Linguistics and Philosophy), Anthonie Meijers (Philosophical Explorations), Henry S. Richardson (Ethics) and Hans Rott (Erkenntnis).
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Verifying One Hundred Prisoners and a Lightbulb.Hans van Ditmarsch & Jan van Eijck - 2010 - Journal of Applied Non-Classical Logics 20 (3):173-191.
    This is a case-study in knowledge representation and dynamic epistemic protocol verification. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents know, how their knowledge changes due to observations, and how they affect the state of the world by changing facts, i.e., by their actions. These actions depend on the history of previous actions and observations. Part of its interest is that all actions are local, i.e. not publicly observable, and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  36
    Editorial Introduction to the Special Issue LORI Guangzhou.Hans van Ditmarsch & Jérôme Lang - 2013 - Synthese 190 (1):1-4.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  34
    Editorial Introduction to the Special Issue LOFT Sevilla.Giacomo Bonanno, Hans van Ditmarsch & Wiebe van der Hoek - 2013 - Journal of Philosophical Logic 42 (6):795-798.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  92
    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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  43
    True Lies.Thomas Ågotnes, Hans van Ditmarsch & Yanjing Wang - 2013 - Synthese 195 (10):4581-4615.
    A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula that becomes true when announced. We investigate true lies and other types of interaction between announced formulas, their preconditions and their postconditions, in the setting of Gerbrandy’s logic of believed announcements, wherein agents may have or obtain incorrect beliefs. Our results are on the satisfiability and validity of instantiations of these semantically (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  65
    The Case of the Hidden Hand.Hans P. van Ditmarsch - 2005 - Journal of Applied Non-Classical Logics 15 (4):437-452.
    In unconditionally secure protocols, a sender and receiver are able to communicate their secrets to each other without the eavesdropper being able to learn the secret, even when the eavesdropper intercepts the entire communication. We investigate such protocols for the special case of deals of cards over players, where two players aim to communicate to each other their hand of cards without the remaining player learning a single card from either hand. In this contribution we show that a particular protocol (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  50
    The Logic of Pit.Hans P. Van Ditmarsch - 2006 - Synthese 149 (2):343-374.
    Pit is a multi-player card game that simulates the commodities trading market, and where actions consist of bidding and of swapping cards. We present a formal description of the knowledge and change of knowledge in that game. The description is in a standard language for dynamic epistemics expanded with assignment. Assignment is necessary to describe that cards change hands. The formal description is a prerequisite to model Pit in game theory. The main contribution of this paper should be seen as (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  66
    Dynamic Consequence and Public Announcement.Andrés Cordón Franco, Hans van Ditmarsch & Angel Nepomuceno - 2013 - Review of Symbolic Logic 6 (4):659-679.
    In van Benthem (2008), van Benthem proposes a dynamic consequence relation defined as \$$\psi _1}, \ldots ,{\psi _n}{ \models ^d}\phi \,{\rm{iff}}{ \models ^{pa}}[{\psi _1}] \ldots [{\psi _n}]\phi \$$ where the latter denotes consequence in public announcement logic, a dynamic epistemic logic. In this paper we investigate the structural properties of a conditional dynamic consequence relation \$$models _{\rm{\Gamma }}^\$$ extending van Benthem, inspired by Makinson (2003) wherein Makinson calls this reasoning a set Γ. In the presence of common knowledge, conditional dynamic (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  37.  14
    Correction To: Dynamics of Lying.Hans van Ditmarsch - 2019 - Synthese 196 (6):2543-2543.
    The original publication of the article is missing the funding information.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  47
    Logic in India—Editorial Introduction.Hans van Ditmarsch, Rohit Parikh & Ramaswamy Ramanujam - 2011 - Journal of Philosophical Logic 40 (5):557-561.
  39.  34
    Johan van Benthem, Modal Logic for Open Minds, CSLI Lecture Notes, Stanford University, 2010, Pp. 350. ISBN: 9781575865997 US $70.00, ISBN: 9781575865980 US $30.00. [REVIEW]Hans van Ditmarsch - 2012 - Studia Logica 100 (5):1055-1057.
  40.  31
    Een analyse van de Hangman Paradox in dynamische epistemische logica.Hans van Ditmarsch & Barteld Kooi - 2005 - Algemeen Nederlands Tijdschrift voor Wijsbegeerte 97:16-30.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  41.  17
    Epistemic Protocols for Dynamic Gossip.Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian & François Schwarzentruber - 2017 - Journal of Applied Logic 20:1-31.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42.  30
    Revocable Belief Revision.Hans van Ditmarsch - 2013 - Studia Logica 101 (6):1185-1214.
    Krister Segerberg proposed irrevocable belief revision, to be contrasted with standard belief revision, in a setting wherein belief of propositional formulas is modelled explicitly. This suggests that in standard belief revision is revocable: one should be able to unmake (‘revoke’) the fresh belief in the revision formula, given yet further information that contradicts it. In a dynamic epistemic logical setting for belief revision, for multiple agents, we investigate what the requirements are for revocable belief revision. By this we not merely (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43.  46
    Special Issue on the Occasion of Johan van Benthem’s 60th Birthday—Editorial.Hans van Ditmarsch & Lawrence S. Moss - 2009 - Journal of Philosophical Logic 38 (6):587-588.
  44.  24
    2004 Annual Conference of the Australasian Association for Logic, Dunedin, New Zealand January 17-18, 2004.Hans van Ditmarsch - 2004 - Bulletin of Symbolic Logic 10 (3):447-451.
  45.  25
    Public Announcements, Public Assignments and the Complexity of Their Logic.Hans van Ditmarsch, Andreas Herzig & Tiago De Lima - 2012 - Journal of Applied Non-Classical Logics 22 (3):249-273.
    We study the extension of public announcement logic PAL by public assignments, which we call PALA. Just as in the case of PAL, the standard procedure for deciding PALA validity, i.e. the use of so-called reduction axioms to translate PALA formulae into formulae in epistemic logic EL, may lead to exponential growth. In this paper, we show that such a price is not mandatory, for we provide a polynomial translation of PALA into EL. This is based on abbreviations of subformulae (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  46.  21
    Foreword.Hans Van Ditmarsch & Andreas Herzig - 2007 - Journal of Applied Non-Classical Logics 17 (2):125-128.
  47.  35
    New Essays on the Knowability Paradox – Edited by Joe Salerno.Hans van Ditmarsch - 2010 - Theoria 76 (3):270-273.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48.  15
    Editorial ‘Tools for Teaching Logic’.Hans van Ditmarsch & Mara Manzano - 2007 - Logic Journal of the IGPL 15 (4):289-292.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  12
    2004 Annual Conference of the Australasian Association for Logic.Hans van Ditmarsch - 2004 - Bulletin of Symbolic Logic 10 (3):447-451.
  50.  19
    Semantics for Knowledge and Change of Awareness.Hans van Ditmarsch & Tim French - 2014 - Journal of Logic, Language and Information 23 (2):169-195.
    We examine various logics that combine knowledge, awareness, and change of awareness. An agent can become aware of propositional propositions but also of other agents or of herself. The dual operation to becoming aware, forgetting, can also be modelled. Our proposals are based on a novel notion of structural similarity that we call awareness bisimulation, the obvious notion of modal similarity for structures encoding knowledge and awareness.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 65