Formalized soundness and completeness of epistemic logic

DOI10.1007/978-3-030-88853-4_1OpenAlexW3204835784MaRDI QIDQ2148773

Asta Halkjær From

Publication date: 24 June 2022

Full work available at URL: https://orbit.dtu.dk/en/publications/4564df77-d713-4363-a7cd-a9e1eefbe7b4

zbMATH Keywords

completenessepistemic logicIsabelle/HOLcanonicity

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (1)

Formalized soundness and completeness of epistemic logic

Uses Software

• Isabelle/HOL
• SQEMA
• FOL Fitting
• Archive Formal Proofs
• Epistemic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic epistemic logic
• Isabelle/HOL. A proof assistant for higher-order logic
• Formalizing a Seligman-style tableau system for hybrid logic (short paper)
• Formalized soundness and completeness of epistemic logic
• Soundness and completeness proofs by coinductive methods
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• Verified Decision Procedures for Modal Logics.

This page was built for publication: Formalized soundness and completeness of epistemic logic