Arbitrary arrow update logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1299411 (Why is no real title available?)
- scientific article; zbMATH DE number 2080355 (Why is no real title available?)
- Arbitrary action model logic and action model synthesis
- Arrow update logic
- Dynamic Epistemic Logic and Knowledge Puzzles
- Group announcement logic
- Hidden protocols: modifying our expectations in an evolving world
- How arbitrary are arbitrary public announcements?
- Knowledge and common knowledge in a distributed environment
- Logics of communication and change
- Logics of public communications
- Quantified epistemic logics for reasoning about knowledge in multi-agent systems
- Quantifying Notes
- Refinement modal logic
- Safety, liveness and fairness in temporal logic
- The undecidability of arbitrary arrow update logic
- Three Partition Refinement Algorithms
- Towards a theory of intention revision
- Undecidability for arbitrary public announcement logic
- What one may come to know
- `Knowable' as `known after an announcement'
Cited in
(12)- To be announced
- Coalition and relativised group announcement logic
- First steps in updating knowing how
- Logics with group announcements and distributed knowledge: completeness and expressive power
- Recapturing dynamic logic of relation changers via bounded morphisms
- Arrow update synthesis
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
- Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
- Arrow update logic
- The undecidability of arbitrary arrow update logic
- The expressivity of update logics
- An arrow-based dynamic logic of normative systems and its decidability
This page was built for publication: Arbitrary arrow update logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343913)