About this topic
Summary Epistemic logics are logics that allow one to reason about knowledge in some way. Doxastic logics are similar, but allow one to reason about belief rather than knowledge. The languages of these logics contain knowledge or belief operators or predicates, governed by appropriate axioms or rules. (Just what axioms and rules are appropriate is a controversial matter, however.) Many epistemic and doxastic logics are modal logics, whose languages contains one or more knowledge or belief operators, and whose semantics is given in terms of relational Kripke models. In such models, the points or states can be thought of as epistemically (or doxastically) possible worlds, related to one another by epistemic (or doxastic) accessibility relations. This modal approach to epistemic and doxastic logic has been widely adopted in formal logic, philosophy, computer science, artificial intelligence, economics and game theory. The category doxastic logic also includes work on belief revision and belief update, which addresses the question: how should an agent revise or update its beliefs, on receiving conflicting information?
Key works Modern epistemic logic began with Hintikka 1962, who developed Kripke-style semantics for epistemic notions and discussed appropriate axioms for knowledge and belief. Hintikka proposes a solution to the logical omniscience problem, whereby agents are treated as automatically knowing all consequences of what they know, in Hintikka 1975. Hintikka's approach is developed and applied to problems in computer science in Fagin 1995. The leading theory of belief revision, the ‘AGM’ theory, was first presented in Alchourrón et al 1985
Introductions Hintikka 1962 is a great introduction to epistemic and doxastic logics; Hendricks 2008 briefly surveys the area. Huber 2013 introduces and discusses AGM theories of belief revision.
Related categories
Siblings:

330 found
Order:
1 — 50 / 330
  1. added 2019-01-03
    Standard State Space Models of Unawareness.Peter Fritz & Harvey Lederman - 2015 - Theoretical Aspects of Rationality and Knowledge 15.
    The impossibility theorem of Dekel, Lipman and Rustichini has been thought to demonstrate that standard state-space models cannot be used to represent unawareness. We first show that Dekel, Lipman and Rustichini do not establish this claim. We then distinguish three notions of awareness, and argue that although one of them may not be adequately modeled using standard state spaces, there is no reason to think that standard state spaces cannot provide models of the other two notions. In fact, standard space (...)
  2. added 2018-11-26
    Factive Knowability and the Problem of Possible Omniscience.Jan Heylen - forthcoming - Philosophical Studies:1-23.
    Famously, the Church–Fitch paradox of knowability is a deductive argument from the thesis that all truths are knowable to the conclusion that all truths are known. In this argument, knowability is analyzed in terms of having the possibility to know. Several philosophers have objected to this analysis, because it turns knowability into a nonfactive notion. In addition, they claim that, if the knowability thesis is reformulated with the help of factive concepts of knowability, then omniscience can be avoided. In this (...)
  3. added 2018-11-05
    A Dynamic Logic of Interrogative Inquiry.Yacin Hamami - 2015 - In Can Başkent (ed.), Perspectives on Interrogative Models of Inquiry: Developments in Inquiry and Questions. Dordrecht: Springer. pp. 129-161.
    We propose a dynamic-epistemic analysis of the different epistemic operations constitutive of the process of interrogative inquiry, as described by Hintikka’s Interrogative Model of Inquiry (IMI). We develop a dynamic logic of questions for representing interrogative steps, based on Hintikka’s treatment of questions in the IMI, along with a dynamic logic of inferences for representing deductive steps, based on the tableau method. We then merge these two systems into a dynamic logic of interrogative inquiry which articulates a joint treatment of (...)
  4. added 2018-09-08
    On a Flawed Argument Against the KK Principle.S. Okasha - 2013 - Analysis 73 (1):80-86.
    Externalists in epistemology often reject the KK principle – which says that if a person knows that p, then they know that they know that p. This paper argues that one standard argument against the KK principle that many externalists make is fallacious, as it involves illicit substitution into an intensional context. The fallacy is exposed and discussed.
  5. added 2018-08-19
    Knowability Relative to Information.Peter Hawke & Franz Berto - forthcoming - Mind.
    We present a formal semantics for epistemic logic, capturing the notion of knowability relative to information (KRI). Like Dretske, we move from the platitude that what an agent can know depends on her (empirical) information. We treat operators of the form K_AB (‘B is knowable on the basis of information A’) as variably strict quantifiers over worlds with a topic- or aboutness- preservation constraint. Variable strictness models the non-monotonicity of knowledge acquisition while allowing knowledge to be intrinsically stable. Aboutness-preservation models (...)
  6. added 2018-07-16
    Impossible Worlds and Partial Belief.Edward Elliott - forthcoming - Synthese:1-26.
    One response to the problem of logical omniscience in standard possible worlds models of belief is to extend the space of worlds so as to include impossible worlds. It is natural to think that essentially the same strategy can be applied to probabilistic models of partial belief, for which parallel problems also arise. In this paper, I note a difficulty with the inclusion of impossible worlds into probabilistic models. Under weak assumptions about the space of worlds, most of the propositions (...)
  7. added 2018-07-01
    Aboutness in Imagination.Franz Berto - 2018 - Philosophical Studies 175 (8):1871-1886.
    I present a formal theory of the logic and aboutness of imagination. Aboutness is understood as the relation between meaningful items and what they concern, as per Yablo and Fine’s works on the notion. Imagination is understood as per Chalmers’ positive conceivability: the intentional state of a subject who conceives that p by imagining a situation—a configuration of objects and properties—verifying p. So far aboutness theory has been developed mainly for linguistic representation, but it is natural to extend it to (...)
  8. added 2018-06-05
    Bridging Ranking Theory and the Stability Theory of Belief.Eric Raidl & Niels Skovgaard-Olsen - 2017 - Journal of Philosophical Logic 46 (6):577-609.
    In this paper we compare Leitgeb’s stability theory of belief and Spohn’s ranking-theoretic account of belief. We discuss the two theories as solutions to the lottery paradox. To compare the two theories, we introduce a novel translation between ranking functions and probability functions. We draw some crucial consequences from this translation, in particular a new probabilistic belief notion. Based on this, we explore the logical relation between the two belief theories, showing that models of Leitgeb’s theory correspond to certain models (...)
  9. added 2018-05-18
    The Preface, the Lottery, and the Logic of Belief.James Hawthorne & Luc Bovens - 1999 - Mind 108 (430):241-264.
    John Locke proposed a straightforward relationship between qualitative and quantitative doxastic notions: belief corresponds to a sufficiently high degree of confidence. Richard Foley has further developed this Lockean thesis and applied it to an analysis of the preface and lottery paradoxes. Following Foley's lead, we exploit various versions of these paradoxes to chart a precise relationship between belief and probabilistic degrees of confidence. The resolutions of these paradoxes emphasize distinct but complementary features of coherent belief. These features suggest principles that (...)
  10. added 2018-05-17
    Defusing the Miners Paradox.Michael Shaffer - 2018 - Filosofiska Notiser 5:57-67.
    This paper presents a case for the claim that the infamous miners paradox is not a paradox. This contention is based on some important observations about the nature of ignorance with respect to both disjunctions and conditional obligations and their modal features. The gist of the argument is that given the uncertainty about the location of the miners in the story and the nature of obligations, the apparent obligation to block either mine shaft is cancelled.
  11. added 2018-04-20
    Tableaux-Based Decision Method for Single-Agent Linear Time Synchronous Temporal Epistemic Logics with Interacting Time and Knowledge.Mai Ajspur & Valentin Goranko - 2013 - In Kamal Lodaya (ed.), Logic and its Applications. Springer. pp. 80--96.
    Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and agents' abilities for learning and recall. In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time and (...)
  12. added 2018-04-20
    Tableau-Based Decision Procedure for the Multiagent Epistemic Logic with All Coalitional Operators for Common and Distributed Knowledge.M. Ajspur, V. Goranko & D. Shkatov - 2013 - Logic Journal of the IGPL 21 (3):407-437.
    We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi\-agent epistemic logic \CMAELCD\ with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for \CMAELCD\ and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using that result, we design an incremental tableau-building procedure that eventually constructs a satisfying Hintikka structure for every satisfiable input set of (...)
  13. added 2018-04-20
    Reasoning About Knowledge, Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. [REVIEW]Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (4):469-473.
  14. added 2018-04-12
    A Dynamic Solution to the Problem of Logical Omniscience.Mattias Skipper & Jens Christian Bjerring - forthcoming - Journal of Philosophical Logic:1-21.
    The traditional possible-worlds model of belief describes agents as "logically omniscient" in the sense that they believe all logical consequences of what they believe, including all logical truths. This is widely considered a problem if we want to reason about the epistemic lives of non-ideal agents who—much like ordinary human beings—are logically competent, but not logically omniscient. A popular strategy for avoiding logical omniscience centers around the use of impossible worlds: worlds that, in one way or another, violate the laws (...)
  15. added 2018-03-21
    Simple Hyperintensional Belief Revision.F. Berto - 2018 - Erkenntnis:1-17.
    I present a possible worlds semantics for a hyperintensional belief revision operator, which reduces the logical idealization of cognitive agents affecting similar operators in doxastic and epistemic logics, as well as in standard AGM belief revision theory. belief states are not closed under classical logical consequence; revising by inconsistent information does not perforce lead to trivialization; and revision can be subject to ‘framing effects’: logically or necessarily equivalent contents can lead to different revisions. Such results are obtained without resorting to (...)
  16. added 2018-02-26
    Modal Epistemology.Juhani Yli-Vakkuri & John Hawthorne - manuscript
    Some central epistemological notions are expressed by sentential operators O that entail the possibility of knowledge in the sense that 'Op' entails 'It is possible to know that p'. We call these modal-epistemological notions. Using apriority and being in a position to know as case studies, we argue that the logics of modal epistemological notions are extremely weak. In particular, their logics are not normal and do not include any closure principles.
  17. added 2018-02-18
    Invitation to Autoepistemology.Lloyd Humberstone - 2002 - Theoria 68 (1):13-51.
    The phrase ‘autoepistemic logic’ was introduced in Moore [1985] to refer to a study inspired in large part by criticisms in Stalnaker [1980] of a particular nonmonotonic logic proposed by McDermott and Doyle.1 Very informative discussions for those who have not encountered this area are provided by Moore [1988] and the wide-ranging survey article Konolige [1994], and the scant remarks in the present introductory section do not pretend to serve in place of those treatments as summaries of the field. A (...)
  18. added 2018-02-18
    Reasoning About Knowledge.Ronald Fagin (ed.) - 1995 - MIT Press.
    Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...
  19. added 2018-02-17
    On a New Tentative Solution to Fitch’s Paradox.Alessandro Giordani - 2016 - Erkenntnis 81 (3):597-611.
    In a recent paper, Alexander argues that relaxing the requirement that sound knowers know their own soundness might provide a solution to Fitch’s paradox and introduces a suitable axiomatic system where the paradox is avoided. In this paper an analysis of this solution is proposed according to which the effective move for solving the paradox depends on the axiomatic treatment of the ontic modality rather than the limitations imposed on the epistemic one. It is then shown that, once the ontic (...)
  20. added 2018-02-17
    Logic For Reasoning About Knowledge.Ewa Orlowska - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6):559-572.
    One of the important issues in research on knowledge based computer systems is development of methods for reasoning about knowledge. In the present paper semantics for knowledge operators is introduced. The underlying logic is developed with epistemic operators relative to indiscernibility. Facts about knowledge expressible in the logic are discussed, in particular common knowledge and joint knowledge of n group of agents. Some paradoxes of epistemic logic are shown to be eliminated in the given system. A formal logical analysis of (...)
  21. added 2018-02-17
    Epistemic Operators.Fred I. Dretske - 1970 - Journal of Philosophy 67 (24):1007-1023.
  22. added 2018-02-16
    Hard and Soft Logical Information.Allo Patrick - 2017 - Journal of Logic and Computation:1-20.
    In this paper I use the distinction between hard and soft information from the dynamic epistemic logic tradition to extend prior work on informational conceptions of logic to include non-monotonic consequence-relations. In particular, I defend the claim that at least some non-monotonic logics can be understood on the basis of soft or “belief-like” logical information, and thereby question the orthodox view that all logical information is hard, “knowledge-like”, information.
  23. added 2018-02-16
    Where’s the Bridge? Epistemology and Epistemic Logic.Vincent F. Hendricks & John Symons - 2006 - Philosophical Studies 128 (1):137-167.
    Epistemic logic begins with the recognition that our everyday talk about knowing and believing has some systematic features that we can track and re‡ect upon. Epistemic logicians have studied and extended these glints of systematic structure in fascinating and important ways since the early 1960s. However, for one reason or another, mainstream epistemologists have shown little interest. It is striking to contrast the marginal role of epistemic logic in contemporary epistemology with the centrality of modal logic for metaphysicians. This article (...)
  24. added 2018-02-06
    Accuracy and Ur-Prior Conditionalization.Nilanjan Das - forthcoming - Review of Symbolic Logic:1-35.
    Recently, several epistemologists have defended an attractive principle of epistemic rationality, which we shall call Ur-Prior Conditionalization. In this essay, I ask whether we can justify this principle by appealing to the epistemic goal of accuracy. I argue that any such accuracy-based argument will be in tension with Evidence Externalism, i.e., the view that agent's evidence may entail non-trivial propositions about the external world. This is because any such argument will crucially require the assumption that, independently of all empirical evidence, (...)
  25. added 2018-01-30
    Composing Models.Jan van Eijck & Yanjing Wang - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):397-425.
    • We study a new composition operation on (epistemic) multiagent models and update actions that takes vocabulary extensions into account.
  26. added 2017-12-20
    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 (...)
  27. added 2017-10-28
    The AGM Theory and Inconsistent Belief Change.Koji Tanaka - 2005 - Logique Et Analyse 48 (189-192):113-150.
    The problem of how to accommodate inconsistencies has attracted quite a number of researchers, in particular, in the area of database theory. The problem is also of concern in the study of belief change. For inconsistent beliefs are ubiquitous. However, comparatively little work has been devoted to discussing the problem in the literature of belief change. In this paper, I examine how adequate the AGM theory is as a logical framework for belief change involving inconsistencies. The technique is to apply (...)
  28. added 2017-10-28
    On An Error In Grove's Proof.Koji Tanaka & Graham Priest - 1997 - Logique Et Analyse 158:215-217.
    Nearly a decade has past since Grove gave a semantics for the AGM postulates. The semantics, called sphere semantics, provided a new perspective of the area of study, and has been widely used in the context of theory or belief change. However, the soundness proof that Grove gives in his paper contains an error. In this note, we will point this out and give two ways of repairing it.
  29. added 2017-10-11
    Topological Models of Belief Logics.Christopher Steinsvold - 2007 - Dissertation, CUNY Graduate Center
    In this highly original text, Christopher Steinsvold explores an alternative semantics for logics of rational belief. Topologies, as mathematical objects, are typically interpreted in terms of space; here topologies are re-interpreted in terms of an agent with rational beliefs. The topological semantics tells us that the agent can never, in principle, know everything; that the agent's beliefs can never be complete. -/- A number of completeness proofs are given for a variety of logics of rational belief. Beyond this, the author (...)
  30. added 2017-10-06
    Nicholas Rescher, Epistemic Logic. A Survey of the Logic of Knowledge. Pittsburgh, University of Pittsburgh Press, 2005. [REVIEW]Jan Heylen - 2006 - Tijdschrift Voor Filosofie 68 (3):644-646.
  31. added 2017-09-11
    Paraconsistent Dynamics.Patrick Girard & Koji Tanaka - 2016 - Synthese 193 (1):1-14.
    It has been an open question whether or not we can define a belief revision operation that is distinct from simple belief expansion using paraconsistent logic. In this paper, we investigate the possibility of meeting the challenge of defining a belief revision operation using the resources made available by the study of dynamic epistemic logic in the presence of paraconsistent logic. We will show that it is possible to define dynamic operations of belief revision in a paraconsistent setting.
  32. added 2017-09-09
    A Perspectivist Approach to Conceptual Spaces.Mauri Kaipainen & Antti Hautamäki - 2015 - In Peter Gärdenfors & Frank Zenker (eds.), Applications of Conceptual Spaces. Springer Verlag.
  33. added 2017-09-08
    An Argument for the Safety Condition on Knowledge.Michael Shaffer - 2017 - Logos and Episteme 8 (4):517-520.
    This paper introduces a new argument for the safety condition on knowledge. It is based on the contention that the rejection of safety entails the rejection of the factivity condition on knowledge. But, since we should maintain factivity, we should endorse safery.
  34. added 2017-06-09
    Natural Deduction for Diagonal Operators.Fabio Lampert - 2017 - In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics: The CSHPM 2016 Annual Meeting in Calgary, Alberta. Cham: Birkhäuser. pp. 39-51.
    We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some point (...)
  35. added 2017-05-28
    Non‐Classical Knowledge.Ethan Jerzak - 2019 - Philosophy and Phenomenological Research 98 (1):190-220.
    The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely-held ideas: that knowledge is factive, that we can know that knowledge is factive, and that we can use logical/mathematical reasoning to extend our knowledge via very weak single-premise closure principles. I argue that classical logic, not any of these epistemic principles, is the culprit. I develop a consistent theory validating (...)
  36. added 2017-05-12
    The Certainty of Skepticism.Paul Oppenheimer & Ralf Meerbote - 1980 - Grazer Philosophische Studien 11:125-128.
    Carrier in a recent paper urges for consideration an argument for skepticism which is based on premises one of which in turn is to be defended by yet another principle (the "Janus Principle" of the text). We feel that the latter principle and the way Carrier wants to use it to defend his skeptical argument will find adherents, but we show that this argument rests on an interesting equivocation quite beyond repair even if we accept the "Janus Principle".
  37. added 2017-05-10
    The Logical Burdens of Proof. Assertion and Hypothesis.Daniele Chiffi & Fabien Schang - 2017 - Logic and Logical Philosophy 26 (4).
    The paper proposes two logical analyses of (the norms of) justification. In a first, realist-minded case, truth is logically independent from justification and leads to a pragmatic logic LP including two epistemic and pragmatic operators, namely, assertion and hypothesis. In a second, antirealist-minded case, truth is not logically independent from justification and results in two logical systems of information and justification: AR4 and AR4¢, respectively, provided with a question-answer semantics. The latter proposes many more epistemic agents, each corresponding to a (...)
  38. added 2017-05-09
    The Logic of Epistemic Justification.Martin Smith - 2018 - Synthese 195 (9):3857-3875.
    Theories of epistemic justification are commonly assessed by exploring their predictions about particular hypothetical cases – predictions as to whether justification is present or absent in this or that case. With a few exceptions, it is much less common for theories of epistemic justification to be assessed by exploring their predictions about logical principles. The exceptions are a handful of ‘closure’ principles, which have received a lot of attention, and which certain theories of justification are well known to invalidate. But (...)
  39. added 2017-05-08
    Doxastic Logic.Michael Caie - forthcoming - Open Handbook of Formal Epistemology.
  40. added 2017-05-08
    Knowledge Means ‘All’, Belief Means ‘Most’.Dimitris Askounis, Costas D. Koutras & Yorgos Zikos - 2016 - Journal of Applied Non-Classical Logics 26 (3):173-192.
    We introduce a bimodal epistemic logic intended to capture knowledge as truth in all epistemically alternative states and belief as a generalised ‘majority’ quantifier, interpreted as truth in most of the epistemically alternative states. This doxastic interpretation is of interest in knowledge-representation applications and it also holds an independent philosophical and technical appeal. The logic comprises an epistemic modal operator, a doxastic modal operator of consistent and complete belief and ‘bridge’ axioms which relate knowledge to belief. To capture the notion (...)
  41. added 2017-05-08
    The Undecidability of Quantified Announcements.T. Ågotnes, H. van Ditmarsch & T. French - 2016 - Studia Logica 104 (4):597-640.
    This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic, group announcement logic, and coalition announcement logic. In APAL we consider the informative consequences of any announcement, in GAL we consider the informative consequences of a group of agents all of which are simultaneously making known announcements. So this is more restrictive than APAL. Finally, CAL is as GAL except that we now quantify over anything the agents not in that group (...)
  42. added 2017-05-08
    A Logic for Reasoning About Knowledge of Unawareness.Thomas Ågotnes & Natasha Alechina - 2014 - Journal of Logic, Language and Information 23 (2):197-217.
    In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of something Ann is not aware of”—without using a stronger statement such as “Ann knows that Bill is aware of \(p\) and Ann is not aware of \(p\) ”, for some particular \(p\) . In Halpern and Rêgo (Proceedings of KR 2006; Games Econ Behav 67(2):503–525, 2009b) Halpern and Rêgo introduced a logic (...)
  43. added 2017-05-08
    Epistemic Logic in the Later Middle Ages.Ivan Boh - 2014 - Routledge.
    _Epistemic Logic_ studies statements containing verbs such as 'know' and 'wish'. It is one of the most exciting areas in medieval philosophy. Neglected almost entirely after the end of the Middle Ages, it has been rediscovered by philosophers of the present century. This is the first comprehensive study of the subject. Ivan Boh explores the rules for entailment between epistemic statements, the search for the conditions of knowing contingent propositions, the problems of substitutivity in intentional contexts, the relationship between epistemic (...)
  44. added 2017-05-08
    The Logic of Justified Belief, Explicit Knowledge, and Conclusive Evidence.Alexandru Baltag, Bryan Renne & Sonja Smets - 2014 - Annals of Pure and Applied Logic 165 (1):49-81.
    We present a complete, decidable logic for reasoning about a notion of completely trustworthy evidence and its relations to justifiable belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemovʼs Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness (...)
  45. added 2017-05-08
    Future Determination of Entities in Talmudic Public Announcement Logic.M. Abraham, I. Belfer, D. M. Gabbay & U. Schild - 2013 - Journal of Applied Logic 11 (1):63-90.
  46. added 2017-05-08
    Completeness of Public Announcement Logic in Topological Spaces.C. A. N. Baskent - 2011 - Bulletin of Symbolic Logic 17 (1):142.
  47. added 2017-05-08
    The Dynamics of Awareness.Benthem Johan van & R. Velázquez-Quesada Fernando - 2010 - Synthese 177 (S1):5 - 27.
    Classical epistemic logic describes implicit knowledge of agents about facts and knowledge of other agents based on semantic information. The latter is produced by acts of observation or communication that are described well by dynamic epistemic logics. What these logics do not describe, however, is how significant information is also produced by acts of inference— and key axioms of the system merely postulate "deductive closure". In this paper, we take the view that all information is produced by acts, and hence (...)
  48. added 2017-05-08
    Group Announcement Logic.Thomas Ågotnes, Philippe Balbiani, Hans van Ditmarsch & Pablo Seban - 2010 - Journal of Applied Logic 8 (1):62-81.
  49. added 2017-05-08
    A Logic of Situated Resource-Bounded Agents.Natasha Alechina & Brian Logan - 2009 - Journal of Logic, Language and Information 18 (1):79-95.
    We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in (...)
  50. added 2017-05-08
    About Cut Elimination for Logics of Common Knowledge.Luca Alberucci & Gerhard Jäger - 2005 - Annals of Pure and Applied Logic 133 (1):73-99.
    The notions of common knowledge or common belief play an important role in several areas of computer science , in philosophy, game theory, artificial intelligence, psychology and many other fields which deal with the interaction within a group of “agents”, agreement or coordinated actions. In the following we will present several deductive systems for common knowledge above epistemic logics –such as K, T, S4 and S5 –with a fixed number of agents. We focus on structural and proof-theoretic properties of these (...)
1 — 50 / 330