Documentation
Foundation
.
Modal
.
Hilbert
.
Maximal
.
Unprovability
Search
return to top
source
Imports
Init
Foundation.Propositional.ClassicalSemantics.Hilbert
Foundation.Modal.Hilbert.Maximal.Basic
Imported by
LO
.
Modal
.
Hilbert
.
Triv
.
unprovable_AxiomL
LO
.
Modal
.
Hilbert
.
Ver
.
unprovable_AxiomP
LO
.
Modal
.
Hilbert
.
K4
.
provable_trivTranslated_Cl
LO
.
Modal
.
Hilbert
.
K4
.
unprovable_AxiomL
LO
.
Modal
.
Hilbert
.
GL
.
provable_verTranslated_Cl
LO
.
Modal
.
Hilbert
.
GL
.
unprovable_AxiomT
LO
.
Modal
.
Hilbert
.
GL
.
instConsistentFormulaNat
LO
.
Modal
.
Hilbert
.
not_S4_weakerThan_GL
source
theorem
LO
.
Modal
.
Hilbert
.
Triv
.
unprovable_AxiomL
{
a
:
ℕ
}
:
Hilbert.Triv
⊬
Axioms.L
(
Formula.atom
a
)
source
theorem
LO
.
Modal
.
Hilbert
.
Ver
.
unprovable_AxiomP
:
Hilbert.Ver
⊬
Axioms.P
source
theorem
LO
.
Modal
.
Hilbert
.
K4
.
provable_trivTranslated_Cl
{
φ
:
Formula
ℕ
}
:
Hilbert.K4
⊢!
φ
→
Propositional.Hilbert.Cl
⊢!
φ
ᵀ
.
toPropFormula
⋯
source
theorem
LO
.
Modal
.
Hilbert
.
K4
.
unprovable_AxiomL
{
a
:
ℕ
}
:
Hilbert.K4
⊬
Axioms.L
(
Formula.atom
a
)
source
theorem
LO
.
Modal
.
Hilbert
.
GL
.
provable_verTranslated_Cl
{
φ
:
Formula
ℕ
}
:
Hilbert.GL
⊢!
φ
→
Propositional.Hilbert.Cl
⊢!
φ
ⱽ
.
toPropFormula
⋯
source
theorem
LO
.
Modal
.
Hilbert
.
GL
.
unprovable_AxiomT
{
a
:
ℕ
}
:
Hilbert.GL
⊬
Axioms.T
(
Formula.atom
a
)
source
instance
LO
.
Modal
.
Hilbert
.
GL
.
instConsistentFormulaNat
:
Entailment.Consistent
Hilbert.GL
source
theorem
LO
.
Modal
.
Hilbert
.
not_S4_weakerThan_GL
:
¬
Hilbert.S4
⪯
Hilbert.GL