Mehrnoosh Sadrzadeh, Corina Ĉırstea
Abstract
Open-access reader
We provide a Coalgebraic semantics for dynamic epistemic logic and prove the muddy children puzzle using recursion. We show how by applying a similar approach to Jacob's predicate lifting to our Coalgebra, one obtains the algebraic logic version of dynmic epistemic logic.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We provide a Coalgebraic semantics for dynamic epistemic logic and prove the muddy children puzzle using recursion. We show how by applying a similar approach to Jacob's predicate lifting to our Coalgebra, one obtains the algebraic logic version of dynmic epistemic logic.
Key concepts: Coalgebra, Algebraic semantics, Recursion (computer science), Algebraic number, Algebra over a field, Dynamic logic (digital electronics), Mathematics, Semantics (computer science)