The following pages link to (Q3086938):
Displaying 21 items.
- True lies (Q143747) (← links)
- The undecidability of quantified announcements (Q310079) (← links)
- Arbitrary arrow update logic (Q343913) (← links)
- Refinement modal logic (Q476194) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- The complexity of one-agent refinement modal logic (Q744988) (← links)
- Positive announcements (Q2046881) (← links)
- Announcement as effort on topological spaces (Q2053358) (← links)
- Arrow update synthesis (Q2216107) (← links)
- The undecidability of arbitrary arrow update logic (Q2404071) (← links)
- Arbitrary public announcement logic with memory (Q2686087) (← links)
- Refinement Quantified Logics of Knowledge (Q2825410) (← links)
- Alternating-Time Temporal Announcement Logic (Q3092297) (← links)
- (Q3384080) (← links)
- ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ (Q3580674) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
- Putting right the wording and the proof of the Truth Lemma for<i>APAL</i> (Q4586133) (← links)
- Propositional quantification in logics of contingency (Q4586155) (← links)
- (Q5028475) (← links)
- To be announced (Q6040661) (← links)
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard (Q6199614) (← links)