Pages that link to "Item:Q3580674"
From MaRDI portal
The following pages link to ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ (Q3580674):
Displayed 39 items.
- The undecidability of quantified announcements (Q310079) (← links)
- Arbitrary arrow update logic (Q343913) (← links)
- Refinement modal logic (Q476194) (← links)
- Information dynamics and uniform substitution (Q484920) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- Logics of temporal-epistemic actions (Q516250) (← links)
- Dynamics we can believe in: a view from the Amsterdam school on the centenary of Evert Willem Beth (Q542124) (← links)
- What will they say? -- Public announcement games (Q542137) (← links)
- Merging DEL and ETL (Q616038) (← links)
- Logic for update products and steps into the past (Q636377) (← links)
- The complexity of one-agent refinement modal logic (Q744988) (← links)
- Group announcement logic (Q975877) (← links)
- Keep `hoping' for rationality: a solution to the backward induction paradox (Q1036069) (← links)
- The many faces of closure and introspection. An ineractive perspective (Q1947027) (← links)
- Positive announcements (Q2046881) (← links)
- Announcement as effort on topological spaces (Q2053358) (← links)
- Verification and strategy synthesis for coalition announcement logic (Q2071573) (← links)
- Weighted modal logic in epistemic and deontic contexts (Q2148817) (← links)
- Logics with group announcements and distributed knowledge: completeness and expressive power (Q2155204) (← links)
- Inquisitive logic as an epistemic logic of knowing how (Q2172829) (← links)
- Arrow update synthesis (Q2216107) (← links)
- Coalition and relativised group announcement logic (Q2236503) (← links)
- The undecidability of arbitrary arrow update logic (Q2404071) (← links)
- Simulative belief logic (Q2446544) (← links)
- Arbitrary public announcement logic with memory (Q2686087) (← links)
- The Complexity of One-Agent Refinement Modal Logic (Q2915064) (← links)
- An Alternative Logic for Knowability (Q3094019) (← links)
- Topological Subset Space Models for Public Announcements (Q3299575) (← links)
- Knowledge, Time, and Paradox: Introducing Sequential Epistemic Logic (Q3299584) (← links)
- (Q3384067) (← links)
- (Q3384080) (← 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)
- (Q5015398) (← links)
- CONTINGENCY AND KNOWING WHETHER (Q5247344) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- To be announced (Q6040661) (← links)
- Everything is learnable, once it is settled (Q6142509) (← links)
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard (Q6199614) (← links)