Formalized soundness and completeness of epistemic logic
From MaRDI portal
Publication:2148773
DOI10.1007/978-3-030-88853-4_1OpenAlexW3204835784MaRDI QIDQ2148773FDOQ2148773
Publication date: 24 June 2022
Full work available at URL: https://orbit.dtu.dk/en/publications/4564df77-d713-4363-a7cd-a9e1eefbe7b4
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modal logic
- Isabelle/HOL. A proof assistant for higher-order logic
- Formalized soundness and completeness of epistemic logic
- Dynamic epistemic logic
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Soundness and completeness proofs by coinductive methods
- Verified Decision Procedures for Modal Logics.
- Formalizing a Seligman-style tableau system for hybrid logic (short paper)
Cited In (6)
- A sound and complete proof theory for the generalized logic of only knowing
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders)
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL
- Formalized soundness and completeness of epistemic logic
- Title not available (Why is that?)
- A naive prover for first-order logic: a minimal example of analytic completeness
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)
