|
gptkbp:instanceOf
|
modal logic system
|
|
gptkbp:characteristic
|
all worlds are accessible from all worlds
necessity and possibility collapse
|
|
gptkbp:extendsTo
|
gptkb:modal_logic_K
gptkb:modal_logic_T
gptkb:modal_logic_S4
|
|
gptkbp:hasAxiom
|
4: □p → □□p
5: ◇p → □◇p
B: p → □◇p
K: □(p → q) → (□p → □q)
T: □p → p
|
|
gptkbp:hasCompleteness
|
complete with respect to equivalence frames
|
|
gptkbp:hasDecidability
|
decidable
|
|
gptkbp:hasDual
|
◇p ≡ ¬□¬p
|
|
gptkbp:hasFiniteModelProperty
|
yes
|
|
gptkbp:hasFrameCondition
|
accessibility relation is an equivalence relation
|
|
gptkbp:hasFrameProperty
|
symmetric
reflexive
transitive
|
|
gptkbp:hasRule
|
gptkb:modus_ponens
necessitation rule
|
|
gptkbp:hasSubgroup
|
gptkb:modal_logic_K
gptkb:modal_logic_T
gptkb:modal_logic_S4
normal modal logics
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
modal logic S5
|
|
gptkbp:namedAfter
|
gptkb:Clarence_Irving_Lewis
|
|
gptkbp:usedIn
|
gptkb:logic
gptkb:alethic_modal_logic
gptkb:possible_worlds_semantics
epistemic logic
|
|
gptkbp:bfsParent
|
gptkb:autoepistemic_logic
|
|
gptkbp:bfsLayer
|
5
|