Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
From MaRDI portal
Publication:3384080
zbMATH Open1483.03010arXiv1707.08754MaRDI QIDQ3384080FDOQ3384080
Authors: Louwe B. Kuijer
Publication date: 14 December 2021
Full work available at URL: https://arxiv.org/abs/1707.08754
Recommendations
Cites Work
- Undecidability for arbitrary public announcement logic
- Arrow update logic
- On Computable Numbers, with an Application to the Entscheidungsproblem
- The undecidability of quantified announcements
- `Knowable' as `known after an announcement'
- Refinement modal logic
- Arbitrary action model logic and action model synthesis
- Group announcement logic
- Arbitrary arrow update logic
- Fully arbitrary public announcements
Cited In (8)
- The undecidability of arbitrary arrow update logic
- Title not available (Why is that?)
- To be announced
- Coalition and relativised group announcement logic
- Arrow update synthesis
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
- Arbitrary arrow update logic
- Second-order propositional modal logic: expressiveness and completeness results
This page was built for publication: Arbitrary arrow update logic with common knowledge is neither RE nor co-RE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384080)