Dynamic logic of product relation changers
From MaRDI portal
Cites work
- A cut-free labelled sequent calculus for dynamic epistemic logic
- A general framework for dynamic epistemic logic: towards canonical correspondences
- A modal framework for relating belief and signed information
- A proof-theoretic semantic analysis of dynamic epistemic logic
- A reduction-based cut-free Gentzen calculus for dynamic epistemic logic
- Arrow update logic
- Arrow update synthesis
- Dynamic logic of preference upgrade
- Equality reasoning in sequent-based calculi
- General dynamic dynamic logic
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 3344563 (Why is no real title available?)
- Internalization: The case of hybrid logics
- Iteration-free PDL with intersection: A complete axiomatization
- Logics for data exchange and communication
- Logics for epistemic programs
- Logics without the contraction rule
- Non-labelled sequent calculi of public announcement expansions of \textbf{K45} and \textbf{S5}
- On axiomatizations of public announcement logic
- PDL with intersection of programs: a complete axiomatization
- Proof theory and algebra in logic
- Reasoning about information change
- Reasoning about preference dynamics.
- Recapturing dynamic logic of relation changers via bounded morphisms
- Resolving distributed knowledge
- Revising a labelled sequent calculus for public announcement logic
- Three faces of recursion axioms: the case of constructive dynamic logic of relation changers
This page was built for publication: Dynamic logic of product relation changers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411883)
