Formalized soundness and completeness of epistemic logic
From MaRDI portal
Publication:2148773
Recommendations
- Set-theoretic completeness for epistemic and conditional logic
- Constructive and mechanised meta-theory of intuitionistic epistemic logic
- Constructive and mechanised meta-theory of IEL and similar modal logics
- Proof theory of epistemic logic of programs
- Stit logic of justification announcements: a completeness result
Cites work
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Dynamic epistemic logic
- Formalized soundness and completeness of epistemic logic
- Formalizing a Seligman-style tableau system for hybrid logic (short paper)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 824735 (Why is no real title available?)
- Isabelle/HOL. A proof assistant for higher-order logic
- Modal logic
- Soundness and completeness proofs by coinductive methods
- Verified Decision Procedures for Modal Logics.
Cited in
(9)- Formalized soundness and completeness of epistemic logic
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
- A sound and complete proof theory for the generalized logic of only knowing
- scientific article; zbMATH DE number 970704 (Why is no real title available?)
- A naive prover for first-order logic: a minimal example of analytic completeness
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL
- Lean formalization of completeness proof for coalition logic with common knowledge
- Formalized soundness and completeness of epistemic and public announcement logic
- Stalnaker's epistemic logic in Isabelle/HOL
Describes a project that uses
Uses Software
This page was built for publication: Formalized soundness and completeness of epistemic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148773)
