207 research outputs found
The Dynamics of Group Knowledge and Belief
5th International Workshop On Philosophy and Logic of Social Reality. 15-17 November 2019.Hokkaido University, Sapporo, Japa
To Be Announced
In this survey we review dynamic epistemic logics with modalities for
quantification over information change. Of such logics we present complete
axiomatizations, focussing on axioms involving the interaction between
knowledge and such quantifiers, we report on their relative expressivity, on
decidability and on the complexity of model checking and satisfiability, and on
applications. We focus on open problems and new directions for research
Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is -hard
Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an
extension of Public Announcement Logic with common knowledge modality and
quantifiers over announcements. We show that the satisfiability problem of
APALC on S5-models, as well as that of two other related logics with
quantification and common knowledge, is -hard. This implies that
neither the validities nor the satisfiable formulas of APALC are recursively
enumerable. Which, in turn, implies that APALC is not finitely axiomatisable.Comment: In Proceedings TARK 2023, arXiv:2307.0400
Set-Theoretic Completeness for Epistemic and Conditional Logic
The standard approach to logic in the literature in philosophy and
mathematics, which has also been adopted in computer science, is to define a
language (the syntax), an appropriate class of models together with an
interpretation of formulas in the language (the semantics), a collection of
axioms and rules of inference characterizing reasoning (the proof theory), and
then relate the proof theory to the semantics via soundness and completeness
results. Here we consider an approach that is more common in the economics
literature, which works purely at the semantic, set-theoretic level. We provide
set-theoretic completeness results for a number of epistemic and conditional
logics, and contrast the expressive power of the syntactic and set-theoretic
approachesComment: This is an expanded version of a paper that appeared in AI and
Mathematics, 199
Explicit Evidence Systems with Common Knowledge
Justification logics are epistemic logics that explicitly include
justifications for the agents' knowledge. We develop a multi-agent
justification logic with evidence terms for individual agents as well as for
common knowledge. We define a Kripke-style semantics that is similar to
Fitting's semantics for the Logic of Proofs LP. We show the soundness,
completeness, and finite model property of our multi-agent justification logic
with respect to this Kripke-style semantics. We demonstrate that our logic is a
conservative extension of Yavorskaya's minimal bimodal explicit evidence logic,
which is a two-agent version of LP. We discuss the relationship of our logic to
the multi-agent modal logic S4 with common knowledge. Finally, we give a brief
analysis of the coordinated attack problem in the newly developed language of
our logic
A gentle introduction to unification in modal logics
International audienceUnification in propositional logics is an active research area. In this paper, we introduce the results we have obtained within the context of modal logics and epistemic logics and we present some of the open problems whose solution will have an important impact on the future of the area.L'unification dans les logiques propositionnelles est un domaine de recherche actif. Dans cet article, nous présentons les résultats que nous avons obtenus dans le cadre des logiques modales et des logiqueś epistémiques et nous introduisons quelques uns des problèmes ouverts dont la résolution aura un impact important sur l'avenir du domaine
- …