Modal logic completeness
Content created by Viktor Yudov.
Created on 2023-10-29.
Last modified on 2024-05-05.
module modal-logic.completeness where
Imports
open import foundation.dependent-pair-types open import foundation.inhabited-types open import foundation.intersections-subtypes open import foundation.propositional-truncations open import foundation.propositions open import foundation.sets open import foundation.subtypes open import foundation.transport-along-identifications open import foundation.unions-subtypes open import foundation.universe-levels open import foundation-core.coproduct-types open import modal-logic.deduction open import modal-logic.formulas open import modal-logic.kripke-semantics
Idea
TODO
Definition
module _ {l1 l2 l3 l4 l5 l6 : Level} {i : Set l1} where completeness : modal-theory l2 i → model-class l3 l4 i l5 l6 → UU (l1 ⊔ l2 ⊔ lsuc l3 ⊔ lsuc l4 ⊔ lsuc l5 ⊔ l6) completeness logic C = class-modal-logic C ⊆ logic
Recent changes
- 2024-05-05. Viktor Yudov. Refactor formulas and module names.
- 2024-05-05. Viktor Yudov. Refactor canonical model theorem.
- 2024-05-01. Viktor Yudov. Small fixes.
- 2024-03-26. Viktor Yudov. Small refactor and add canonical axioms.
- 2024-02-07. Viktor Yudov. Prove completeness K.