Logics of public communications
From MaRDI portal
Publication:2460188
Recommendations
- Public Announcements, Private Actions and Common Knowledge in S5 Structures
- `Knowable' as `known after an announcement'
- The logic of public announcements, common knowledge, and private suspicions
- A guide to completeness and complexity for modal logics of knowledge and belief
- La connaissance commune en logique modale
Cites work
- Epistemology without knowledge and without belief
- Factives, Blindspots and Some Paradoxes
- Handbook of philosophical logic. Volume II: Extensions of classical logic
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- scientific article; zbMATH DE number 46167 (Why is no real title available?)
Cited in
(only showing first 100 items - show all)- Temporal languages for epistemic programs
- Public and private communication are different: Results on relative expressivity
- Merging frameworks for interaction
- A note on the wise girls puzzle
- Combinatorial bitstring semantics for arbitrary logical fragments
- The many faces of closure and introspection. An ineractive perspective
- Verification of dynamic bisimulation theorems in Coq
- Endogenizing epistemic actions
- Verification and strategy synthesis for coalition announcement logic
- Discrete linear temporal logic with knowing-value operator
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- On inverse operators in dynamic epistemic logic
- Logics with group announcements and distributed knowledge: completeness and expressive power
- The fundamental problem of logical omniscience
- Populational announcement logic (PPAL)
- A four-valued dynamic epistemic logic
- Coalition and relativised group announcement logic
- A simple logic of functional dependence
- Toward a theory of play: a logical perspective on games and interaction
- Formalising privacy policies in social networks
- Evaluations of epistemic components for resolving the muddy children puzzle
- The modal logic of copy and remove
- The undecidability of arbitrary arrow update logic
- Realizing public announcements by justifications
- Knowledge and communication: A first-order theory
- Comments to `Logics of public communications'
- The undecidability of iterated modal relativization
- A logic of knowing why
- Refinement quantified logics of knowledge
- Justifications for common knowledge
- Logics of rational interaction
- Exploring the power of converse events
- The expressivity of factual change in dynamic epistemic logic
- Reasoning About Substructures and Games
- The logic of public announcements, common knowledge, and private suspicions
- A qualitative theory of dynamic interactive belief revision
- Logical dynamics of evidence
- Knowledge and action in semi-public environments
- A dynamic analysis of interactive rationality
- Seeing, Knowledge and Common Knowledge
- Arrow update logic
- Topological subset space models for public announcements
- Possible worlds semantics based on observation and communication
- Coalition and group announcement logic
- scientific article; zbMATH DE number 7444870 (Why is no real title available?)
- A new modal framework for epistemic logic
- Arbitrary arrow update logic
- Algebraic Semantics for Dynamic Dynamic Logic
- Sum and Product in Dynamic Epistemic Logic
- scientific article; zbMATH DE number 5703818 (Why is no real title available?)
- `Knowable' as `known after an announcement'
- Multi-agent justification logic: communication and evidence elimination
- scientific article; zbMATH DE number 4108735 (Why is no real title available?)
- Evidence and plausibility in neighborhood structures
- SOLUTION OF A NUMBER THEORETIC PROBLEM INVOLVING KNOWLEDGE
- Reasoning about knowledge and messages in asynchronous multi-agent systems
- THE LOGIC OF RESOURCES AND CAPABILITIES
- Putting right the wording and the proof of the truth lemma for \textit{APAL}
- Dynamic epistemic logics: promises, problems, shortcomings, and perspectives
- Announcement as effort on topological spaces
- scientific article; zbMATH DE number 7444842 (Why is no real title available?)
- How to agree without understanding each other: public announcement logic with Boolean definitions
- Syntactic awareness in logical dynamics
- Paraconsistent dynamics
- Inquisitive dynamic epistemic logic
- Channel theoretic reflections on dynamic logics of speech acts
- Knowing values and public inspection
- Logic and probabilistic update
- Incorporating action models into the situation calculus
- A Formal Model for Polarization under Confirmation Bias in Social Networks
- AI 2005: Advances in Artificial Intelligence
- A formal model of multi-agent belief-interaction
- A formal model of multi-agent belief-interaction
- The effort of reasoning: modelling the inference steps of boundedly rational agents
- The epistemology of nondeterminism
- Epistemic planning: perspectives on the special issue
- A logic of ``black box classifier systems
- An Abstract Look at Awareness Models and Their Dynamics
- Dynamic modal logic with counting: when reduction axioms work and fail
- Unification of Modal Logic via Topological Categories
- Logic of visibility in social networks
- Non-monotonic reasoning via dynamic consequence
- Program semantics and verification technique for AI-centred programs
- Providing personalized explanations: a conversational approach
- Dynamic logics of knowledge and access
- Dynamic logics of evidence-based beliefs
- Reasoning about permitted announcements
- Data graphs with incomplete information (and a way to complete them)
- Action models for coalition logic
- A temporal logic for successive events
- Non-labelled sequent calculi of public announcement expansions of \textbf{K45} and \textbf{S5}
- Knowledge representation: modalities, conditionals, and nonmonotonic reasoning
- Minimizing agents' state corruption resulting from leak-free epistemic communication modeling
- No finite model property for logics of quantified announcements
- Visibility and exploitation in social networks
- Realizing impossibilities
- Graded relation updates in modal logic
- Arbitrary announcements in social networks: a finitary proof system
- Knowable as knowing how to inquire
- Tailoring explanations through conversation
This page was built for publication: Logics of public communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460188)
