Normal Modal Logics

Axiomatic Derivations

Equation form expr-00f18ba81ffa3b28

K⊢□(A→B)→(◇A→◇B)\Log{K} \Proves \Box(!A \lif !B) \lif (\Diamond!A \lif \Diamond!B)

Read as: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis diamond formula A implies diamond formula B close parenthesis

Means: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis diamond formula A implies diamond formula B close parenthesis

Equation form expr-00fcf6f067f4a5be

KA1…An⊢dual\Log{K}!A_1\dots!A_n \Proves \Dual

Read as: modal system K formula A subscript one and so on formula A subscript n derives the duality axiom

Means: modal system K formula A subscript one and so on formula A subscript n derives the duality axiom

Equation form expr-023b85f6fb6dccc1

KT5⊢□◇□A→□□A\Log{KT5} \Proves \Box\Diamond\Box!A \lif \Box\Box!A

Read as: modal system K T five derives box diamond box formula A implies box box formula A

Means: modal system K T five derives box diamond box formula A implies box box formula A

Equation form expr-03985b3ffef33a06

Γ⊢Σ¬A→⊥\Gamma \Proves[\Sigma] \lnot!A \lif \lfalse

Read as: Gamma derives in system Sigma not formula A implies falsity

Means: Gamma derives in system Sigma not formula A implies falsity

Equation form expr-04ccf2258fa7fd73

¬□¬A\lnot\Box\lnot !A

Read as: not box not formula A

Means: not box not formula A

Equation form expr-053c54186942dd46

Dual\Ax{Dual}

Read as: axiom dual

Means: axiom dual

Equation form expr-061949694fc5a2d0

Bn≡A!B_n \ident !A

Read as: formula B subscript n is syntactically identical to formula A

Means: formula B subscript n is syntactically identical to formula A

Equation form expr-07291b17720eb742

A[D1/p1,…,Dn/pn]∈Σ,\SSubst{!A}{\subst{!D_1}{p_1}, \dots, \subst{!D_n}{p_n}} \in \Sigma,

Read as: the result of simultaneously substituting formula D subscript one for propositional variable p subscript one comma and so on comma formula D subscript n for propositional variable p subscript n in formula A belongs to Sigma comma

Means: the result of simultaneously substituting formula D subscript one for propositional variable p subscript one comma and so on comma formula D subscript n for propositional variable p subscript n in formula A belongs to Sigma comma

Equation form expr-07f71904c4a486bd

KTB⊬5\Log{KTB} \Proves/ \Log{5}

Read as: modal system K T B does not derive modal system five

Means: modal system K T B does not derive modal system five

Equation form expr-08488b55c227bb59

<k<k

Read as: is less than k

Means: is less than k

Equation form expr-092317f4ffe738ba

KT5⊢B\Log{KT5} \Proves \Ax{B}

Read as: modal system K T five derives axiom B

Means: modal system K T five derives axiom B

Equation form expr-09af01ee56582782

□A→□(B→(A∧B))\Box!A \lif \Box(!B \lif (!A \land !B))

Read as: box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis

Means: box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis

Equation form expr-0a5f32fe2818b758

KD⊢B\Log{KD} \Proves !B

Read as: modal system K D derives formula B

Means: modal system K D derives formula B

Equation form expr-0b5da97f1d4da2bf

C⊆Ci\mClass{C} \subseteq \mClass{C}_i

Read as: class C of models is a subset of class C of models subscript i

Means: class C of models is a subset of class C of models subscript i

Equation form expr-0bde4816bf6d76c3

K\Log K

Read as: modal system K

Means: modal system K

Equation form expr-0c19163583ee4bfc

□((A∧B)→A)→(□(A∧B)→□A)\Box((!A \land !B) \lif !A) \lif (\Box(!A \land !B) \lif \Box!A)

Read as: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis

Means: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis

Equation form expr-0c4ca6278f066c60

KT5⊢□A→□◇□A\Log{KT5} \Proves \Box!A \lif \Box\Diamond\Box!A

Read as: modal system K T five derives box formula A implies box diamond box formula A

Means: modal system K T five derives box formula A implies box diamond box formula A

Equation form expr-0e6552391680df3d

(¬□¬¬p→◇¬p)(\lnot \Box \lnot\lnot p \lif \Diamond \lnot p)

Read as: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis

Means: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis

Equation form expr-102884d364453489

K⊢C[A/q]↔C[B/q]\Log{K} \Proves \Subst{!C}{!A}{q} \liff \Subst{!C}{!B}{q}

Read as: modal system K derives the result of substituting formula A for propositional variable q in formula C if and only if the result of substituting formula B for propositional variable q in formula C

Means: modal system K derives the result of substituting formula A for propositional variable q in formula C if and only if the result of substituting formula B for propositional variable q in formula C

Equation form expr-103542f371fe8edd

Γ∪{A}⊢ΣB\Gamma \cup \{ !A\} \Proves[\Sigma] !B

Read as: Gamma union open set formula A close set derives in system Sigma formula B

Means: Gamma union open set formula A close set derives in system Sigma formula B

Equation form expr-1078b1cad3f129a0

□¬A\Box\lnot !A

Read as: box not formula A

Means: box not formula A

Equation form expr-12318729933c8a39

KDB4⊢□□A→◇□A\Log{KDB4} \Proves \Box\Box!A \lif \Diamond\Box!A

Read as: modal system K D B four derives box box formula A implies diamond box formula A

Means: modal system K D B four derives box box formula A implies diamond box formula A

Equation form expr-13f237de7b4b344c

(A∧B)→B(!A \land !B) \lif !B

Read as: open parenthesis formula A and formula B close parenthesis implies formula B

Means: open parenthesis formula A and formula B close parenthesis implies formula B

Equation form expr-148de9c5a7a44d19

pp

Read as: propositional variable p

Means: propositional variable p

Equation form expr-15428c53a6d72152

□(A→(B→(A∧B)))→(□A→□(B→(A∧B)))\Box(!A \lif (!B \lif (!A \land !B))) \lif (\Box!A \lif \Box(!B \lif (!A \land !B)))

Read as: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Means: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Equation form expr-165a2676a255cdfb

KT⊢D\Log{KT} \Proves \Ax{D}

Read as: modal system K T derives axiom D

Means: modal system K T derives axiom D

Equation form expr-16b95c611a54e3bb

A=¬p!A = \lnot p

Read as: formula A equals not propositional variable p

Means: formula A equals not propositional variable p

Equation form expr-18866b84545a9559

Σ′\Sigma'

Read as: Sigma prime

Means: Sigma prime

Equation form expr-189f40034be7a199

jj

Read as: j

Means: j

Equation form expr-19581e27de7ced00

99

Read as: nine

Means: nine

Equation form expr-19840bcd955ee83f

KB4⊢◇◇A→◇A\Log{KB4} \Proves \Diamond\Diamond !A \lif \Diamond !A

Read as: modal system K B four derives diamond diamond formula A implies diamond formula A

Means: modal system K B four derives diamond diamond formula A implies diamond formula A

Equation form expr-1a063c50d61363dc

K⊢◇(A∨B)→(◇B∨◇A)\Log{K} \Proves \Diamond(!A\lor!B) \lif (\Diamond!B \lor \Diamond!A)

Read as: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula B or diamond formula A close parenthesis

Means: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula B or diamond formula A close parenthesis

Equation form expr-1a8025b822ea3ae8

(□(A∧B)→□A)→(\Box(!A \land !B) \lif \Box!A) \lif{}

Read as: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis implies open set close set

Means: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis implies open set close set

Equation form expr-1b16b1df538ba12d

nn

Read as: n

Means: n

Equation form expr-1b6b21b5976caa8c

K⊢□(A∨B)→(◇A∨□B)\Log{K} \Proves \Box(!A \lor !B) \lif (\Diamond !A \lor \Box !B)

Read as: modal system K derives box open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula A or box formula B close parenthesis

Means: modal system K derives box open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula A or box formula B close parenthesis

Equation form expr-1c7c647db363a3d5

K⊢¬(A∨B)→¬A\Log{K} \Proves \lnot(!A \lor !B) \lif \lnot!A

Read as: modal system K derives not open parenthesis formula A or formula B close parenthesis implies not formula A

Means: modal system K derives not open parenthesis formula A or formula B close parenthesis implies not formula A

Equation form expr-1e095d3ffc5363ea

KB5⊢4\Log{KB5} \Proves \Ax{4}

Read as: modal system K B five derives axiom four

Means: modal system K B five derives axiom four

Equation form expr-1edbbd842397f724

T◇\Ax{T_\Diamond}

Read as: axiom T subscript diamond

Means: axiom T subscript diamond

Equation form expr-1f2c1ee94265bef0

KA1…An⊢B\Log{K}!A_1\dots !A_n \Proves !B

Read as: modal system K formula A subscript one and so on formula A subscript n derives formula B

Means: modal system K formula A subscript one and so on formula A subscript n derives formula B

Equation form expr-2089967f10a9b8f2

□(B→(A∧B))→(□B→□(A∧B))\Box(!B \lif (!A \land !B)) \lif (\Box!B \lif \Box(!A \land !B))

Read as: box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis

Means: box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis

Equation form expr-216c5d7f3e59d6c0

K⊢A→(B→(A∧B))\Log{K} \Proves !A \lif (!B \lif (!A \land !B))

Read as: modal system K derives formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis

Means: modal system K derives formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis

Equation form expr-21d031b0dacd8cc7

K\Log{K}

Read as: modal system K

Means: modal system K

Equation form expr-2265d2c05f6ad387

¬□p→¬□¬¬p\lnot \Box p \lif \lnot\Box\lnot\lnot p

Read as: not box propositional variable p implies not box not not propositional variable p

Means: not box propositional variable p implies not box not not propositional variable p

Equation form expr-22a89cafaee2591f

(□(A∧B)→(□A∧□B))(\Box(!A \land !B) \lif (\Box !A \land \Box!B))

Read as: open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis

Means: open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis

Equation form expr-231e35a00ca52652

M⊮□p→□□p[w1]\mSat/{M}{\Box p \lif \Box\Box p}[w_1]

Read as: model M does not satisfy box propositional variable p implies box box propositional variable p at world w subscript one

Means: model M does not satisfy box propositional variable p implies box box propositional variable p at world w subscript one

Equation form expr-240381337f804e9f

A→B!A \lif !B

Read as: formula A implies formula B

Means: formula A implies formula B

Equation form expr-24cd4e56416f5e50

⊮◇¬p\mSat/{{}}{\Diamond\lnot p}

Read as: the displayed model does not satisfy diamond not propositional variable p at every world

Means: the displayed model does not satisfy diamond not propositional variable p at every world

Equation form expr-257be58da2eade38

□A→◇A\Box!A \lif \Diamond!A

Read as: box formula A implies diamond formula A

Means: box formula A implies diamond formula A

Equation form expr-25b3e180818b5473

Γ∪Δ⊢ΣB\Gamma \cup \Delta \Proves[\Sigma] !B

Read as: Gamma union Delta derives in system Sigma formula B

Means: Gamma union Delta derives in system Sigma formula B

Equation form expr-270dc0fdb619ba89

KDB4⊢◇□A→A\Log{KDB4} \Proves \Diamond\Box!A \lif !A

Read as: modal system K D B four derives diamond box formula A implies formula A

Means: modal system K D B four derives diamond box formula A implies formula A

Equation form expr-28a789f9715e1be9

>1> 1

Read as: is greater than one

Means: is greater than one

Equation form expr-2c624232cdd22177

88

Read as: eight

Means: eight

Equation form expr-2d1270bb640714d1

(¬□¬¬p→◇¬p)→(¬□p→◇¬p)(\lnot \Box \lnot\lnot p \lif \Diamond \lnot p) \lif (\lnot \Box p \lif \Diamond\lnot p)

Read as: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis

Means: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis

Equation form expr-2d7530d3a21435c8

k>1k>1

Read as: k is greater than one

Means: k is greater than one

Equation form expr-2d7f97cd2a0481c5

Γ,A⊢ΣB\Gamma, !A \Proves[\Sigma] !B

Read as: Gamma comma formula A derives in system Sigma formula B

Means: Gamma comma formula A derives in system Sigma formula B

Equation form expr-2e18ad1f908942dc

KD⊬□p→p\Log{KD} \Proves/ \Box p \lif p

Read as: modal system K D does not derive box propositional variable p implies propositional variable p

Means: modal system K D does not derive box propositional variable p implies propositional variable p

Equation form expr-2ed749931ec462f5

¬◇A\lnot\Diamond !A

Read as: not diamond formula A

Means: not diamond formula A

Equation form expr-2f70130c7ab5739f

K∈ΣK \in \Sigma

Read as: K belongs to Sigma

Means: K belongs to Sigma

Equation form expr-2fc04c33adb96f01

K⊢□¬A→(¬□¬(A∨B)→¬□¬B)\Log{K} \Proves \Box\lnot !A \lif (\lnot \Box \lnot (!A \lor!B) \lif \lnot\Box\lnot !B)

Read as: modal system K derives box not formula A implies open parenthesis not box not open parenthesis formula A or formula B close parenthesis implies not box not formula B close parenthesis

Means: modal system K derives box not formula A implies open parenthesis not box not open parenthesis formula A or formula B close parenthesis implies not box not formula B close parenthesis

Equation form expr-2fc31acef0d322e4

KTB4=KT5=KDB4=KDB5\Log{KTB4} = \Log{KT5} = \Log{KDB4} = \Log{KDB5}

Read as: modal system K T B four equals modal system K T five equals modal system K D B four equals modal system K D B five

Means: modal system K T B four equals modal system K T five equals modal system K D B four equals modal system K D B five

Equation form expr-3106fac3e3c8f992

w2w_2

Read as: w subscript two

Means: w subscript two

Equation form expr-319b49b17c38d247

Bn∈Γ!B_n \in \Gamma

Read as: formula B subscript n belongs to Gamma

Means: formula B subscript n belongs to Gamma

Equation form expr-31d6a90607a6bc01

(□A→(□B→□(A∧B))))(\Box!A \lif (\Box !B \lif \Box(!A \land !B))))

Read as: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis

Means: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis

Equation form expr-31ee67f41c5384b5

B∈KA1…An!B \in \Log{K}!A_1 \dots !A_n

Read as: formula B belongs to modal system K formula A subscript one and so on formula A subscript n

Means: formula B belongs to modal system K formula A subscript one and so on formula A subscript n

Equation form expr-32f11b9dc837c819

Bk!B_k

Read as: formula B subscript k

Means: formula B subscript k

Equation form expr-3313ce876fcd6074

K⊢□A→□(B→A)\Log{K} \Proves \Box!A \lif \Box (!B\lif !A)

Read as: modal system K derives box formula A implies box open parenthesis formula B implies formula A close parenthesis

Means: modal system K derives box formula A implies box open parenthesis formula B implies formula A close parenthesis

Equation form expr-331bbe87972d0b2f

□(¬¬p→p)→(□¬¬p→□p)\Box(\lnot\lnot p \lif p) \lif (\Box \lnot\lnot p \lif \Box p)

Read as: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis implies open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis

Means: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis implies open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis

Equation form expr-33a13c40e931da5f

B≡□C!B \equiv \Box !C

Read as: formula B is equivalent to box formula C

Means: formula B is equivalent to box formula C

Equation form expr-341d96cde465b372

B2!B_2

Read as: formula B subscript two

Means: formula B subscript two

Equation form expr-343d2a2c1ab275b2

K⊢¬◇A↔□¬A\Log{K} \Proves \lnot\Diamond !A \liff \Box\lnot !A

Read as: modal system K derives not diamond formula A if and only if box not formula A

Means: modal system K derives not diamond formula A if and only if box not formula A

Equation form expr-3719bd0e81217b5a

K⊢(◇A→□B)→□(A→B)\Log{K} \Proves (\Diamond !A \lif \Box !B) \lif \Box(!A \lif !B)

Read as: modal system K derives open parenthesis diamond formula A implies box formula B close parenthesis implies box open parenthesis formula A implies formula B close parenthesis

Means: modal system K derives open parenthesis diamond formula A implies box formula B close parenthesis implies box open parenthesis formula A implies formula B close parenthesis

Equation form expr-379b609d18ceb5b3

K⊢¬A→(¬B→¬(A∨B))\Log{K} \Proves \lnot !A \lif (\lnot !B \lif \lnot (!A \lor !B))

Read as: modal system K derives not formula A implies open parenthesis not formula B implies not open parenthesis formula A or formula B close parenthesis close parenthesis

Means: modal system K derives not formula A implies open parenthesis not formula B implies not open parenthesis formula A or formula B close parenthesis close parenthesis

Equation form expr-3994f5bb8fc49c9b

K⊢◇¬p↔¬□¬¬p\Log{K} \Proves \Diamond \lnot p \liff \lnot\Box\lnot\lnot p

Read as: modal system K derives diamond not propositional variable p if and only if not box not not propositional variable p

Means: modal system K derives diamond not propositional variable p if and only if not box not not propositional variable p

Equation form expr-3aca066f86c9298a

KA1…An⊢C→B\Log{K}!A_1\dots!A_n \Proves !C \lif !B

Read as: modal system K formula A subscript one and so on formula A subscript n derives formula C implies formula B

Means: modal system K formula A subscript one and so on formula A subscript n derives formula C implies formula B

Equation form expr-3b60a51ca60feb0d

K⊢□A→(◇(A→B)→◇B)\Log{K} \Proves \Box!A \lif (\Diamond(!A \lif !B) \lif \Diamond !B)

Read as: modal system K derives box formula A implies open parenthesis diamond open parenthesis formula A implies formula B close parenthesis implies diamond formula B close parenthesis

Means: modal system K derives box formula A implies open parenthesis diamond open parenthesis formula A implies formula B close parenthesis implies diamond formula B close parenthesis

Equation form expr-3bc29fc095523486

◇¬p↔¬□¬¬p\Diamond \lnot p \liff \lnot\Box\lnot\lnot p

Read as: diamond not propositional variable p if and only if not box not not propositional variable p

Means: diamond not propositional variable p if and only if not box not not propositional variable p

Equation form expr-3c5592ed3a6cb02b

Γ⊢Σ⊥\Gamma \Proves[\Sigma] \lfalse

Read as: Gamma derives in system Sigma falsity

Means: Gamma derives in system Sigma falsity

Equation form expr-3d1e5ad3c4923511

K⊢(A→B)→(¬B→¬A)\Log{K} \Proves (!A \lif !B) \lif (\lnot !B \lif \lnot !A)

Read as: modal system K derives open parenthesis formula A implies formula B close parenthesis implies open parenthesis not formula B implies not formula A close parenthesis

Means: modal system K derives open parenthesis formula A implies formula B close parenthesis implies open parenthesis not formula B implies not formula A close parenthesis

Equation form expr-3e01c74c53729a40

K⊢□A→(□B→□(A∧B)))\Log{K} \Proves \Box!A \lif (\Box !B \lif \Box(!A \land !B)))

Read as: modal system K derives box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Means: modal system K derives box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Equation form expr-3f96bc573087aa57

A∈Σ!A \in \Sigma

Read as: formula A belongs to Sigma

Means: formula A belongs to Sigma

Equation form expr-438757f12dd8c3fc

w1w_1

Read as: w subscript one

Means: w subscript one

Equation form expr-43a9c3c2e61f7961

(□¬¬p→□p)(\Box \lnot\lnot p \lif \Box p)

Read as: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis

Means: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis

Equation form expr-43fa93d0be1e4969

C→B∈KA1…An!C \lif !B \in \Log{K}!A_1 \dots !A_n

Read as: formula C implies formula B belongs to modal system K formula A subscript one and so on formula A subscript n

Means: formula C implies formula B belongs to modal system K formula A subscript one and so on formula A subscript n

Equation form expr-4446fcf0cd4d6fb1

□A→□(B→A)\Box!A \lif \Box (!B\lif !A)

Read as: box formula A implies box open parenthesis formula B implies formula A close parenthesis

Means: box formula A implies box open parenthesis formula B implies formula A close parenthesis

Equation form expr-44a0cd8d367911cf

KB4⊢◇A→□◇A\Log{KB4} \Proves \Diamond!A \lif \Box\Diamond!A

Read as: modal system K B four derives diamond formula A implies box diamond formula A

Means: modal system K B four derives diamond formula A implies box diamond formula A

Equation form expr-453110e031e4f41a

¬¬p→p\lnot\lnot p \lif p

Read as: not not propositional variable p implies propositional variable p

Means: not not propositional variable p implies propositional variable p

Equation form expr-4794277b410dfc51

¬p\lnot p

Read as: not propositional variable p

Means: not propositional variable p

Equation form expr-47bd1b3452eab684

¬□¬\lnot\Box\lnot

Read as: not box not

Means: not box not

Equation form expr-47c6793cea7c1123

Ck=B!C_k = !B

Read as: formula C subscript k equals formula B

Means: formula C subscript k equals formula B

Equation form expr-49fbfbae7391d15b

K\Ax{K}

Read as: axiom K

Means: axiom K

Equation form expr-4a44dc15364204a8

1010

Read as: ten

Means: ten

Equation form expr-4a8223ac7b0e9518

KB≠K4\Log{KB} \neq \Log{K4}

Read as: modal system K B is not equal to modal system K four

Means: modal system K B is not equal to modal system K four

Equation form expr-4b32f069e8444936

(□A→(□B→□(A∧B)))(\Box!A \lif (\Box !B \lif \Box(!A \land !B)))

Read as: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Means: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Equation form expr-4bd801cb1572ecb0

(A→⊥)→((¬A→⊥)→⊥)(!A \lif \lfalse) \lif ((\lnot!A \lif \lfalse) \lif \lfalse)

Read as: open parenthesis formula A implies falsity close parenthesis implies open parenthesis open parenthesis not formula A implies falsity close parenthesis implies falsity close parenthesis

Means: open parenthesis formula A implies falsity close parenthesis implies open parenthesis open parenthesis not formula A implies falsity close parenthesis implies falsity close parenthesis

Equation form expr-4dd70e1f2e572d71

C=C1∩…∩Cn\mClass{C} = \mClass{C}_1 \cap \dots \cap \mClass{C}_n

Read as: class C of models equals class C of models subscript one intersected with and so on intersected with class C of models subscript n

Means: class C of models equals class C of models subscript one intersected with and so on intersected with class C of models subscript n

Equation form expr-4e07408562bedb8b

33

Read as: three

Means: three

Equation form expr-4ee59b68125f5f6c

(□p∨□q)→□(p∨q)(\Box p \lor \Box q) \lif \Box(p \lor q)

Read as: open parenthesis box propositional variable p or box propositional variable q close parenthesis implies box open parenthesis propositional variable p or propositional variable q close parenthesis

Means: open parenthesis box propositional variable p or box propositional variable q close parenthesis implies box open parenthesis propositional variable p or propositional variable q close parenthesis

Equation form expr-4ef706eb029cf11a

K⊢□(A→B)→(◇A→◇B)\Log{K} \Proves \Box (!A \lif !B) \lif (\Diamond !A \lif \Diamond !B)

Read as: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis diamond formula A implies diamond formula B close parenthesis

Means: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis diamond formula A implies diamond formula B close parenthesis

Equation form expr-500c11a94df59a45

KA1…An\Log{K} !A_1 \dots !A_n

Read as: modal system K formula A subscript one and so on formula A subscript n

Means: modal system K formula A subscript one and so on formula A subscript n

Equation form expr-506924f8b577f722

K⊢¬□p→◇¬p\Log{K} \Proves \lnot\Box p \lif \Diamond \lnot p

Read as: modal system K derives not box propositional variable p implies diamond not propositional variable p

Means: modal system K derives not box propositional variable p implies diamond not propositional variable p

Equation form expr-50f74f36c7758da0

□((A∧B)→B)\Box((!A \land !B) \lif !B)

Read as: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis

Means: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis

Equation form expr-50f8049a09f05d01

Bj!B_j

Read as: B subscript j

Means: B subscript j

Equation form expr-5136fc4246e7d497

◇\Diamond

Read as: diamond

Means: diamond

Equation form expr-51aeea8ffa05d262

n−1n-1

Read as: n minus one

Means: n minus one

Equation form expr-51e7856994a926ec

Γ⊢ΣA∨B\Gamma \Proves[\Sigma] !A \lor !B

Read as: Gamma derives in system Sigma formula A or formula B

Means: Gamma derives in system Sigma formula A or formula B

Equation form expr-52baf5b113b97063

KDB4⊢T\Log{KDB4} \Proves \Ax{T}

Read as: modal system K D B four derives axiom T

Means: modal system K D B four derives axiom T

Equation form expr-52bb5adcf016a8a2

Γ⊬Σ⊥\Gamma \Proves/[\Sigma] \lfalse

Read as: Gamma does not derive in system Sigma falsity

Means: Gamma does not derive in system Sigma falsity

Equation form expr-53c8b8afb540c2ea

K⊢◇A→◇(A∨B)\Log{K} \Proves \Diamond!A \lif \Diamond(!A \lor !B)

Read as: modal system K derives diamond formula A implies diamond open parenthesis formula A or formula B close parenthesis

Means: modal system K derives diamond formula A implies diamond open parenthesis formula A or formula B close parenthesis

Equation form expr-5414c01467975560

⊮□◇¬p\mSat/{{}}{\Box\Diamond\lnot p}

Read as: the displayed model does not satisfy box diamond not propositional variable p at every world

Means: the displayed model does not satisfy box diamond not propositional variable p at every world

Equation form expr-546773d1ccbf5c7a

K⊢(□A∧□B)→□(A∧B)\Log{K}\Proves (\Box!A \land \Box!B) \lif \Box (!A \land !B)

Read as: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Means: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Equation form expr-559582ac022e201a

□((A∧B)→B)→(□(A∧B)→□B)\Box((!A \land !B) \lif !B) \lif (\Box(!A \land !B) \lif \Box!B)

Read as: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis

Means: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis

Equation form expr-55c17123174d849d

Σ′⊢A\Sigma' \Proves !A

Read as: Sigma prime derives formula A

Means: Sigma prime derives formula A

Equation form expr-560ac2b1f4286405

(□A→(□B→□(A∧B))))→(\Box!A \lif (\Box !B \lif \Box(!A \land !B)))) \lif {}

Read as: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis implies open set close set

Means: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis implies open set close set

Equation form expr-56eaa7e521d8b68a

C≡A→B!C \ident !A \lif !B

Read as: formula C is syntactically identical to formula A implies formula B

Means: formula C is syntactically identical to formula A implies formula B

Equation form expr-573dcf0de5d66fd4

A1→(A2→⋯(An−1→An)⋯)!A_1 \lif (!A_2 \lif \cdots (!A_{n-1} \lif !A_n)\cdots)

Read as: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n - one implies formula A subscript n close parenthesis and so on close parenthesis

Means: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n - one implies formula A subscript n close parenthesis and so on close parenthesis

Equation form expr-57885e4c75965b23

Γ\Gamma

Read as: Gamma

Means: Gamma

Equation form expr-580dbff7b7bba68a

Γ⊢ΣA1\Gamma \Proves[\Sigma] !A_1

Read as: Gamma derives in system Sigma formula A subscript one

Means: Gamma derives in system Sigma formula A subscript one

Equation form expr-581916bfec222f93

(p→q)→(¬q→¬p)(p→q)→((q→r)→(p→r)).& (p \lif q) \lif (\lnot q \lif \lnot p) \\ & (p \lif q) \lif ((q \lif r) \lif (p \lif r)).

Read as: Two tautological schemata. First: if p implies q, then if not q, then not p. Second: if p implies q, then if q implies r, then p implies r.

Means: Two tautological schemata. First: if p implies q, then if not q, then not p. Second: if p implies q, then if q implies r, then p implies r.

Equation form expr-59ffeaf5963458db

(◇¬p↔¬□¬¬p)→(\Diamond \lnot p \liff \lnot\Box\lnot\lnot p) \lif {}

Read as: open parenthesis diamond not propositional variable p if and only if not box not not propositional variable p close parenthesis implies open set close set

Means: open parenthesis diamond not propositional variable p if and only if not box not not propositional variable p close parenthesis implies open set close set

Equation form expr-5a6035a3fb0dfbd8

Ck!C_k

Read as: formula C subscript k

Means: formula C subscript k

Equation form expr-5a8201e9de54d471

□(A∧B)→□A\Box(!A \land !B) \lif \Box!A

Read as: box open parenthesis formula A and formula B close parenthesis implies box formula A

Means: box open parenthesis formula A and formula B close parenthesis implies box formula A

Equation form expr-5c830159f595bce4

K⊢A1\Log{K} \Proves !A_1

Read as: modal system K derives formula A subscript one

Means: modal system K derives formula A subscript one

Equation form expr-5cd68f262fd86ad0

(□(B→(A∧B))→(□B→□(A∧B)))→(\Box(!B \lif (!A \land !B)) \lif (\Box!B \lif \Box(!A \land !B))) \lif {}

Read as: open parenthesis box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set

Means: open parenthesis box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set

Equation form expr-5d8d083cbb26120c

KT⊢D\Log{KT} \Proves \Log{D}

Read as: modal system K T derives modal system D

Means: modal system K T derives modal system D

Equation form expr-5d8f6af316e3245f

K⊢◇B→◇(A∨B)\Log{K} \Proves \Diamond!B \lif \Diamond(!A \lor !B)

Read as: modal system K derives diamond formula B implies diamond open parenthesis formula A or formula B close parenthesis

Means: modal system K derives diamond formula B implies diamond open parenthesis formula A or formula B close parenthesis

Equation form expr-5e22763a65c3f0a3

KDB4⊢□A→A\Log{KDB4} \Proves \Box!A \lif !A

Read as: modal system K D B four derives box formula A implies formula A

Means: modal system K D B four derives box formula A implies formula A

Equation form expr-5e585fb8dfd9f7c9

Γ⊆Δ\Gamma \subseteq \Delta

Read as: Gamma is a subset of Delta

Means: Gamma is a subset of Delta

Equation form expr-6061a5591edaa80a

5◇\Ax{5_\Diamond}

Read as: axiom five subscript diamond

Means: axiom five subscript diamond

Equation form expr-60a4de1bd67e026d

K⊢¬¬p↔p\Log{K} \Proves \lnot\lnot p \liff p

Read as: modal system K derives not not propositional variable p if and only if propositional variable p

Means: modal system K derives not not propositional variable p if and only if propositional variable p

Equation form expr-60add8f35a287afd

KD5≠KT4=S4\Log{KD5} \neq \Log{KT4} = \Log{S4}

Read as: modal system K D five is not equal to modal system K T four equals modal system S four

Means: modal system K D five is not equal to modal system K T four equals modal system S four

Equation form expr-619c6509406bf4f8

⊮□p\mSat/{{}}{\Box p}

Read as: the displayed model does not satisfy box propositional variable p at every world

Means: the displayed model does not satisfy box propositional variable p at every world

Equation form expr-61f3515f0e2771bd

Γ⊢Σ¬A\Gamma \Proves[\Sigma] \lnot !A

Read as: Gamma derives in system Sigma not formula A

Means: Gamma derives in system Sigma not formula A

Equation form expr-63806ef7f6aa0dee

KT5⊢A→□◇A\Log{KT5} \Proves !A \lif \Box\Diamond!A

Read as: modal system K T five derives formula A implies box diamond formula A

Means: modal system K T five derives formula A implies box diamond formula A

Equation form expr-67bb42c13a45506c

⊢C(B)\Proves !C(!B)

Read as: derives formula C open parenthesis formula B close parenthesis

Means: derives formula C open parenthesis formula B close parenthesis

Equation form expr-6875e4221251441e

¬□q→◇¬p\lnot \Box q \lif \Diamond \lnot p

Read as: not box propositional variable q implies diamond not propositional variable p

Means: not box propositional variable q implies diamond not propositional variable p

Equation form expr-68af1b29d5f49fb3

Σ⊢A\Sigma \Proves !A

Read as: Sigma derives formula A

Means: Sigma derives formula A

Equation form expr-691a0b96f32b9f7e

KB4⊢◇A→□◇◇A\Log{KB4} \Proves \Diamond!A \lif \Box \Diamond\Diamond!A

Read as: modal system K B four derives diamond formula A implies box diamond diamond formula A

Means: modal system K B four derives diamond formula A implies box diamond diamond formula A

Equation form expr-6b86b273ff34fce1

11

Read as: one

Means: one

Equation form expr-6d34fa36d139b1d0

Γ⊢ΣA→⊥\Gamma \Proves[\Sigma] !A \to \lfalse

Read as: Gamma derives in system Sigma formula A implies falsity

Means: Gamma derives in system Sigma formula A implies falsity

Equation form expr-6e248011b2a8b9e1

Γ⊢ΣB→A\Gamma \Proves[\Sigma] !B \lif !A

Read as: Gamma derives in system Sigma formula B implies formula A

Means: Gamma derives in system Sigma formula B implies formula A

Equation form expr-6e9c39a8bb74cb83

⊢A↔B\Proves !A \liff !B

Read as: derives formula A if and only if formula B

Means: derives formula A if and only if formula B

Equation form expr-6fb4d8e138798b3d

dual\Dual

Read as: the duality axiom

Means: the duality axiom

Equation form expr-7120f8695fd9aa83

KB4⊢5\Log{KB4} \Proves \Ax{5}

Read as: modal system K B four derives axiom five

Means: modal system K B four derives axiom five

Equation form expr-72039af57d5ec07d

K⊢◇¬⊥→(□A→◇A)\Log{K} \Proves \Diamond \lnot \lfalse \lif (\Box !A \lif \Diamond !A)

Read as: modal system K derives diamond not falsity implies open parenthesis box formula A implies diamond formula A close parenthesis

Means: modal system K derives diamond not falsity implies open parenthesis box formula A implies diamond formula A close parenthesis

Equation form expr-72fb6b0ff9a2ed1c

K⊢(◇A∨◇B)→◇(A∨B)\Log{K} \Proves (\Diamond!A \lor\Diamond!B) \lif \Diamond(!A \lor !B)

Read as: modal system K derives open parenthesis diamond formula A or diamond formula B close parenthesis implies diamond open parenthesis formula A or formula B close parenthesis

Means: modal system K derives open parenthesis diamond formula A or diamond formula B close parenthesis implies diamond open parenthesis formula A or formula B close parenthesis

Equation form expr-74fbe4a1906c905e

¬¬A\lnot\lnot !A

Read as: not not formula A

Means: not not formula A

Equation form expr-751379acac529582

◇p→◇(p∨q)\Diamond p \lif \Diamond(p \lor q)

Read as: diamond propositional variable p implies diamond open parenthesis propositional variable p or propositional variable q close parenthesis

Means: diamond propositional variable p implies diamond open parenthesis propositional variable p or propositional variable q close parenthesis

Equation form expr-773bd9f41893c402

B∈KA1…An!B \in \Log{K}!A_1\dots!A_n

Read as: formula B belongs to modal system K formula A subscript one and so on formula A subscript n

Means: formula B belongs to modal system K formula A subscript one and so on formula A subscript n

Equation form expr-776e6199da44defe

row label T◇p→◇prow label B◇◇□p→prow label 4◇◇◇p→◇prow label 5◇◇□p→□p\tag{\Ax{T_\Diamond}} p & \lif \Diamond p\\ \tag{\Ax{B_\Diamond}} \Diamond\Box p & \lif p\\ \tag{\Ax{4_\Diamond}} \Diamond\Diamond p & \lif \Diamond p\\ \tag{\Ax{5_\Diamond}} \Diamond\Box p & \lif \Box p

Read as: The four dual schemata, in order. T diamond: if p then possibly p. B diamond: if possibly necessarily p then p. Four diamond: if possibly possibly p then possibly p. Five diamond: if possibly necessarily p then necessarily p.

Means: The four dual schemata, in order. T diamond: if p then possibly p. B diamond: if possibly necessarily p then p. Four diamond: if possibly possibly p then possibly p. Five diamond: if possibly necessarily p then necessarily p.

Equation form expr-78e80e6c22a9a4b7

KA1…An⊢B\Log{K} !A_1 \dots !A_n \Proves !B

Read as: modal system K formula A subscript one and so on formula A subscript n derives formula B

Means: modal system K formula A subscript one and so on formula A subscript n derives formula B

Equation form expr-790f441d2dc498bc

(□(A∧B)→□B)→(\Box(!A \land !B) \lif \Box!B) \lif{}

Read as: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set

Means: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set

Equation form expr-7b8dff15e7d0e9be

Dn!D_n

Read as: formula D subscript n

Means: formula D subscript n

Equation form expr-7b981162fa144a02

KB5⊢□A→□◇□A\Log{KB5} \Proves \Box!A \lif \Box\Diamond\Box !A

Read as: modal system K B five derives box formula A implies box diamond box formula A

Means: modal system K B five derives box formula A implies box diamond box formula A

Equation form expr-7c92cb41f5dc5782

¬◇¬\lnot\Diamond\lnot

Read as: not diamond not

Means: not diamond not

Equation form expr-7d2ec9b68b9609db

KD⊊KT\Log{KD} \subsetneq \Log{KT}

Read as: modal system K D is a proper subset of modal system K T

Means: modal system K D is a proper subset of modal system K T

Equation form expr-7d44f5dae51c5481

((□(A∧B)→□B)→((\Box(!A \land !B) \lif \Box!B) \lif{}

Read as: open parenthesis open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set

Means: open parenthesis open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set

Equation form expr-7ffee107cfb27a7b

KT⊢□A→◇A\Log{KT} \Proves \Box !A \lif \Diamond !A

Read as: modal system K T derives box formula A implies diamond formula A

Means: modal system K T derives box formula A implies diamond formula A

Equation form expr-8009e7649758501d

Γ,A⊢Σ⊥\Gamma, !A \Proves[\Sigma] \lfalse

Read as: Gamma comma formula A derives in system Sigma falsity

Means: Gamma comma formula A derives in system Sigma falsity

Equation form expr-804eecd0d613d453

K⊢□(A→B)→(□¬B→□¬A)\Log{K} \Proves \Box(!A \lif !B) \lif (\Box\lnot!B \lif \Box\lnot!A)

Read as: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis box not formula B implies box not formula A close parenthesis

Means: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis box not formula B implies box not formula A close parenthesis

Equation form expr-8063806edfa91aa3

KD⊆KT\Log{KD} \subseteq \Log{KT}

Read as: modal system K D is a subset of modal system K T

Means: modal system K D is a subset of modal system K T

Equation form expr-8238c028f61fc0f7

A!A

Read as: formula A

Means: formula A

Equation form expr-8251e8502b2ca005

dual∈Σ\Dual \in \Sigma

Read as: the duality axiom belongs to Sigma

Means: the duality axiom belongs to Sigma

Equation form expr-85c3ce29e3a4dc40

C\mClass{C}

Read as: class C of models

Means: class C of models

Equation form expr-861c59f6c65c88e0

K⊢C[B/q]\Log{K} \Proves \Subst{!C}{B}{q}

Read as: modal system K derives the result of substituting formula B for propositional variable q in formula C

Means: modal system K derives the result of substituting formula B for propositional variable q in formula C

Equation form expr-874748ebc3ce81d4

((□A∧□B)→□(A∧B))((\Box!A \land \Box!B) \lif \Box(!A \land !B))

Read as: open parenthesis open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis close parenthesis

Means: open parenthesis open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis close parenthesis

Equation form expr-88ede056472d4ec7

⊢C(A)\Proves !C(!A)

Read as: derives formula C open parenthesis formula A close parenthesis

Means: derives formula C open parenthesis formula A close parenthesis

Equation form expr-89d4d22866321b82

row label K□(p→q)→(□p→□q),row label dual◇p↔¬□¬p\tag{\Ax{K}} & \Box(p \lif q) \lif (\Box p \lif \Box q), \\ \tag{\Dual} & \Diamond p \liff \lnot\Box\lnot p

Read as: tagged axiom K next alignment column box open parenthesis propositional variable p implies propositional variable q close parenthesis implies open parenthesis box propositional variable p implies box propositional variable q close parenthesis comma next line tagged the duality axiom next alignment column diamond propositional variable p if and only if not box not propositional variable p

Means: tagged axiom K next alignment column box open parenthesis propositional variable p implies propositional variable q close parenthesis implies open parenthesis box propositional variable p implies box propositional variable q close parenthesis comma next line tagged the duality axiom next alignment column diamond propositional variable p if and only if not box not propositional variable p

Equation form expr-89d67874d1f6d123

K⊢□¬A→(□¬B→□¬(A∨B))\Log{K} \Proves \Box\lnot !A \lif (\Box\lnot!B \lif \Box \lnot (!A \lor !B))

Read as: modal system K derives box not formula A implies open parenthesis box not formula B implies box not open parenthesis formula A or formula B close parenthesis close parenthesis

Means: modal system K derives box not formula A implies open parenthesis box not formula B implies box not open parenthesis formula A or formula B close parenthesis close parenthesis

Equation form expr-8bd2005830815bd2

□A\Box!A

Read as: box formula A

Means: box formula A

Equation form expr-8c02bb37c0e400a6

⊩◇¬p\mSat{{}}{\Diamond\lnot p}

Read as: the displayed model satisfies diamond not propositional variable p at every world

Means: the displayed model satisfies diamond not propositional variable p at every world

Equation form expr-8d06eb5be2ab477b

M⊮□p→□□p[w1]\mSat/{M}{\Box p \to \Box \Box p}[w_1]

Read as: model M does not satisfy box propositional variable p implies box box propositional variable p at world w subscript one

Means: model M does not satisfy box propositional variable p implies box box propositional variable p at world w subscript one

Equation form expr-8e37e5feabde8d38

KDB4⊢□A→□□A\Log{KDB4} \Proves \Box!A \lif \Box\Box!A

Read as: modal system K D B four derives box formula A implies box box formula A

Means: modal system K D B four derives box formula A implies box box formula A

Equation form expr-8eb83b2ad42d11d3

K⊢□A→(¬□¬(A→B)→¬□¬B)\Log{K} \Proves \Box!A \lif (\lnot \Box\lnot (!A\lif !B) \lif \lnot \Box\lnot!B)

Read as: modal system K derives box formula A implies open parenthesis not box not open parenthesis formula A implies formula B close parenthesis implies not box not formula B close parenthesis

Means: modal system K derives box formula A implies open parenthesis not box not open parenthesis formula A implies formula B close parenthesis implies not box not formula B close parenthesis

Equation form expr-8f4c747df4608f85

KA1…An⊢K\Log{K}!A_1\dots!A_n \Proves \Ax{K}

Read as: modal system K formula A subscript one and so on formula A subscript n derives axiom K

Means: modal system K formula A subscript one and so on formula A subscript n derives axiom K

Equation form expr-8f707e40fb6af3d1

(□¬¬p→□p)→(¬□p→¬□¬¬p)(\Box \lnot\lnot p \lif \Box p) \lif (\lnot \Box p \lif \lnot\Box\lnot\lnot p)

Read as: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis

Means: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis

Equation form expr-8f983d6fea027c03

C1∩…∩Cn\mClass{C}_1 \cap \dots \cap \mClass{C}_n

Read as: class C of models subscript one intersected with and so on intersected with class C of models subscript n

Means: class C of models subscript one intersected with and so on intersected with class C of models subscript n

Equation form expr-8fded0ecc6c367dd

KDB4⊢□□A→A\Log{KDB4} \Proves \Box\Box!A \lif !A

Read as: modal system K D B four derives box box formula A implies formula A

Means: modal system K D B four derives box box formula A implies formula A

Equation form expr-903d52c30476fc27

Γ⊬ΣA\Gamma \Proves/[\Sigma] !A

Read as: Gamma does not derive in system Sigma formula A

Means: Gamma does not derive in system Sigma formula A

Equation form expr-928d3dcddf5279f8

B∈Σ!B \in \Sigma

Read as: formula B belongs to Sigma

Means: formula B belongs to Sigma

Equation form expr-92b59bb8de3808b7

Bi!B_i

Read as: formula B subscript i

Means: formula B subscript i

Equation form expr-93aa632d054e9ffb

A→(B→A)!A \lif (!B \lif !A)

Read as: formula A implies open parenthesis formula B implies formula A close parenthesis

Means: formula A implies open parenthesis formula B implies formula A close parenthesis

Equation form expr-954d59819434a41a

A→(B→(A∧B))!A \lif (!B \lif (!A \land !B))

Read as: formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis

Means: formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis

Equation form expr-966b2d3dcfa7cc20

⊩□p,⊮□□p\mSat{{}}{\Box p}, \mSat/{{}}{\Box\Box p}

Read as: the displayed model satisfies box propositional variable p at every world comma the displayed model does not satisfy box box propositional variable p at every world

Means: the displayed model satisfies box propositional variable p at every world comma the displayed model does not satisfy box box propositional variable p at every world

Equation form expr-973219f61c684db2

⊮□□p\mSat/{{}}{\Box\Box p}

Read as: the displayed model does not satisfy box box propositional variable p at every world

Means: the displayed model does not satisfy box box propositional variable p at every world

Equation form expr-9763a163e7ff6591

w3w_3

Read as: w subscript three

Means: w subscript three

Equation form expr-9861ca19be665e0a

D\Ax{D}

Read as: axiom D

Means: axiom D

Equation form expr-98b3da780aeffee8

KB4⊢□◇◇A→□◇A\Log{KB4} \Proves \Box\Diamond\Diamond !A \lif \Box \Diamond!A

Read as: modal system K B four derives box diamond diamond formula A implies box diamond formula A

Means: modal system K B four derives box diamond diamond formula A implies box diamond formula A

Equation form expr-992accb9917efeb5

C!C

Read as: formula C

Means: formula C

Equation form expr-9947646a3ceed43b

K⊢(□A∧□B)→□(A∧B)\Log{K} \Proves (\Box!A \land \Box!B) \lif \Box (!A \land !B)

Read as: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Means: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Equation form expr-9a44b9bb01db1eac

Δ⊢ΣA\Delta \Proves[\Sigma] !A

Read as: Delta derives in system Sigma formula A

Means: Delta derives in system Sigma formula A

Equation form expr-9b550f2bb9885b69

KT5⊢□A→◇□A\Log{KT5} \Proves \Box!A \lif \Diamond\Box!A

Read as: modal system K T five derives box formula A implies diamond box formula A

Means: modal system K T five derives box formula A implies diamond box formula A

Equation form expr-9b91d4c4c00d00f8

KA=KA◇\Log{K}!A = \Log{K}!A_{\Diamond}

Read as: modal system K formula A equals modal system K formula A subscript diamond

Means: modal system K formula A equals modal system K formula A subscript diamond

Equation form expr-9c46576ff4aee158

KT5⊢A→◇A\Log{KT5} \Proves !A \lif \Diamond!A

Read as: modal system K T five derives formula A implies diamond formula A

Means: modal system K T five derives formula A implies diamond formula A

Equation form expr-9cdeed6ed221f857

K⊢(◇A∨◇B)→◇(A∨B)\Log{K} \Proves (\Diamond!A \lor \Diamond!B) \lif \Diamond(!A \lor !B)

Read as: modal system K derives open parenthesis diamond formula A or diamond formula B close parenthesis implies diamond open parenthesis formula A or formula B close parenthesis

Means: modal system K derives open parenthesis diamond formula A or diamond formula B close parenthesis implies diamond open parenthesis formula A or formula B close parenthesis

Equation form expr-9da3705cc5efefce

{B:KA1…An⊢B}⊆KA1…An\Setabs{!B}{\Log{K} !A_1 \dots !A_n \Proves !B} \subseteq \Log{K} !A_1 \dots !A_n

Read as: the set of formula B such that modal system K formula A subscript one and so on formula A subscript n derives formula B is a subset of modal system K formula A subscript one and so on formula A subscript n

Means: the set of formula B such that modal system K formula A subscript one and so on formula A subscript n derives formula B is a subset of modal system K formula A subscript one and so on formula A subscript n

Equation form expr-9e4668e35b07aeed

□A1→(□A2→⋯(□An−1→□An)⋯).\Box!A_1 \lif (\Box!A_2 \lif \cdots (\Box!A_{n-1} \lif \Box!A_n)\cdots).

Read as: box formula A subscript one implies open parenthesis box formula A subscript two implies and so on open parenthesis box formula A subscript n - one implies box formula A subscript n close parenthesis and so on close parenthesis period

Means: box formula A subscript one implies open parenthesis box formula A subscript two implies and so on open parenthesis box formula A subscript n - one implies box formula A subscript n close parenthesis and so on close parenthesis period

Equation form expr-9f3adbad42513293

KT5⊢◇□A→□A\Log{KT5} \Proves \Diamond\Box!A \lif \Box!A

Read as: modal system K T five derives diamond box formula A implies box formula A

Means: modal system K T five derives diamond box formula A implies box formula A

Equation form expr-a0ad19b3662c695f

Γ⊢ΣB\Gamma \Proves[\Sigma] !B

Read as: Gamma derives in system Sigma formula B

Means: Gamma derives in system Sigma formula B

Equation form expr-a0be2a80eca4a7c9

A1→(A2→⋯(An−1→An)⋯)∈ΣBy the induction hypothesis, we have□A1→(□A2→⋯□(An−1→An)⋯)∈ΣSince Σ is a normal modal logic, it contains all instances of K, in particular□(An−1→An)→(□An−1→□An)∈ΣUsing modus ponens and suitable tautological instances we get□A1→(□A2→⋯(□An−1→□An)⋯)∈Σ.& !A_1 \lif (!A_2 \lif \cdots (!A_{n-1} \lif !A_n)\cdots) \in \Sigma \intertext{By the induction hypothesis, we have} & \Box!A_1 \lif (\Box!A_2 \lif \cdots \Box(!A_{n-1} \lif !A_n)\cdots) \in \Sigma \intertext{Since $\Sigma$ is a normal modal logic, it contains all instances of~$\Ax{K}$, in particular} & \Box(!A_{n-1} \lif !A_n) \lif (\Box!A_{n-1} \lif \Box!A_n) \in \Sigma \intertext{Using modus ponens and suitable tautological instances we get} & \Box!A_1 \lif (\Box!A_2 \lif \cdots (\Box!A_{n-1} \lif \Box!A_n)\cdots) \in \Sigma.

Read as: Induction display for rule R K. First assume the nested conditional from A one through A n belongs to Sigma. By the induction hypothesis, the corresponding nested conditional has boxes on A one through A n minus one, and a box around the final conditional. Since Sigma is normal, it contains the K instance taking that boxed final conditional to the conditional from box A n minus one to box A n. Modus ponens and propositional tautologies give the fully boxed nested conditional.

Means: Induction display for rule R K. First assume the nested conditional from A one through A n belongs to Sigma. By the induction hypothesis, the corresponding nested conditional has boxes on A one through A n minus one, and a box around the final conditional. Since Sigma is normal, it contains the K instance taking that boxed final conditional to the conditional from box A n minus one to box A n. Modus ponens and propositional tautologies give the fully boxed nested conditional.

Equation form expr-a10d1e8bd329c89a

Γ∪{¬A}\Gamma \cup \{ \lnot!A \}

Read as: Gamma union open set not formula A close set

Means: Gamma union open set not formula A close set

Equation form expr-a13c4538b2c8a517

K⊢□A1→(□A2→⋯(□An−1→□An)…)\Log{K} \Proves \Box !A_1 \lif (\Box !A_2 \lif \cdots (\Box !A_{n-1} \lif \Box !A_n)\dots)

Read as: modal system K derives box formula A subscript one implies open parenthesis box formula A subscript two implies and so on open parenthesis box formula A subscript n - one implies box formula A subscript n close parenthesis and so on close parenthesis

Means: modal system K derives box formula A subscript one implies open parenthesis box formula A subscript two implies and so on open parenthesis box formula A subscript n - one implies box formula A subscript n close parenthesis and so on close parenthesis

Equation form expr-a158c8ba25884247

K⊢A\Log{K} \Proves !A

Read as: modal system K derives formula A

Means: modal system K derives formula A

Equation form expr-a27dc218af2e26e3

K⊢□(A→B)→(¬□¬A→¬□¬B)\Log{K} \Proves \Box(!A \lif !B) \lif (\lnot \Box\lnot!A \lif \lnot\Box\lnot!B)

Read as: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis

Means: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis

Equation form expr-a32559d88fbf8b15

A→C!A \lif !C

Read as: formula A implies formula C

Means: formula A implies formula C

Equation form expr-a3550a26e80e1d24

((¬□¬¬p→◇¬p)→(¬□p→◇¬p))((\lnot \Box \lnot\lnot p \lif \Diamond \lnot p) \lif (\lnot \Box p \lif \Diamond\lnot p))

Read as: open parenthesis open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis close parenthesis

Means: open parenthesis open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis close parenthesis

Equation form expr-a41c104b89d839cd

(□A→□(B→(A∧B)))→(\Box!A \lif \Box(!B \lif (!A \land !B))) \lif {}

Read as: open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set

Means: open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set

Equation form expr-a4448888755f3ded

¬□p→◇¬p\lnot\Box p \lif \Diamond \lnot p

Read as: not box propositional variable p implies diamond not propositional variable p

Means: not box propositional variable p implies diamond not propositional variable p

Equation form expr-a69f0090227bdc1b

M⊮◇¬p→□◇¬p[w2]\mSat/{M}{\Diamond \lnot p \lif \Box \Diamond \lnot p}[w_2]

Read as: model M does not satisfy diamond not propositional variable p implies box diamond not propositional variable p at world w subscript two

Means: model M does not satisfy diamond not propositional variable p implies box diamond not propositional variable p at world w subscript two

Equation form expr-a81c5dff5a355f30

A1→(A2→⋯(An→B)…)!A_1 \lif (!A_2 \lif \cdots (!A_n \lif !B)\dots)

Read as: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n implies formula B close parenthesis and so on close parenthesis

Means: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n implies formula B close parenthesis and so on close parenthesis

Equation form expr-a90fd7c7139176dc

K⊢¬□¬(A∨B)→(¬¬□¬B→¬□¬A)\Log{K} \Proves \lnot \Box \lnot(!A\lor!B) \lif (\lnot \lnot\Box\lnot!B \lif \lnot\Box\lnot!A)

Read as: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis not not box not formula B implies not box not formula A close parenthesis

Means: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis not not box not formula B implies not box not formula A close parenthesis

Equation form expr-aa1d4eafd3d3b4e2

¬□¬¬p→◇¬p\lnot \Box \lnot\lnot p \lif \Diamond \lnot p

Read as: not box not not propositional variable p implies diamond not propositional variable p

Means: not box not not propositional variable p implies diamond not propositional variable p

Equation form expr-aa413926f024cbf8

nec\Nec

Read as: necessitation

Means: necessitation

Equation form expr-ab342c2b31de328b

Γ,¬A⊢Σ⊥\Gamma, \lnot !A \Proves[\Sigma] \lfalse

Read as: Gamma comma not formula A derives in system Sigma falsity

Means: Gamma comma not formula A derives in system Sigma falsity

Equation form expr-ab65862f3a9a5605

(□(A∧B)→(□A∧□B)))(\Box(!A \land !B) \lif (\Box !A \land \Box!B)))

Read as: open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis close parenthesis

Means: open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis close parenthesis

Equation form expr-ab768e094a624812

K⊢¬□¬(A∨B)→(□¬A→¬□¬B)\Log{K} \Proves \lnot \Box \lnot(!A \lor !B) \lif (\Box \lnot !A \lif \lnot\Box\lnot !B)

Read as: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis box not formula A implies not box not formula B close parenthesis

Means: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis box not formula A implies not box not formula B close parenthesis

Equation form expr-ace37362f4ba506b

KA1…An⊢B\Log{K}!A_1\dots!A_n \Proves !B

Read as: modal system K formula A subscript one and so on formula A subscript n derives formula B

Means: modal system K formula A subscript one and so on formula A subscript n derives formula B

Equation form expr-ae6f502e1eafd390

Bn!B_n

Read as: formula B subscript n

Means: formula B subscript n

Equation form expr-aedc11f05c691d13

□(A∧B)→□B\Box(!A \land !B) \lif \Box!B

Read as: box open parenthesis formula A and formula B close parenthesis implies box formula B

Means: box open parenthesis formula A and formula B close parenthesis implies box formula B

Equation form expr-b09ff6a930a933f1

(¬□p→¬□¬¬p)→(\lnot \Box p \lif \lnot\Box\lnot\lnot p) \lif {}

Read as: open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis implies open set close set

Means: open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis implies open set close set

Equation form expr-b166fed420776931

K⊢An\Log{K} \Proves !A_n

Read as: modal system K derives formula A subscript n

Means: modal system K derives formula A subscript n

Equation form expr-b20e9d692ac74bcc

□A→□B\Box !A \lif \Box !B

Read as: box formula A implies box formula B

Means: box formula A implies box formula B

Equation form expr-b2766662c1b2b4b3

Γ∪{B}⊢ΣA\Gamma \cup \{!B\} \Proves[\Sigma] !A

Read as: Gamma union open set formula B close set derives in system Sigma formula A

Means: Gamma union open set formula B close set derives in system Sigma formula A

Equation form expr-b2e4530d11f452e0

K⊢A↔B\Log{K} \Proves !A \liff !B

Read as: modal system K derives formula A if and only if formula B

Means: modal system K derives formula A if and only if formula B

Equation form expr-b37271a74c8e10eb

(□A∧□B)→□(A∧B)(\Box!A \land \Box!B) \lif \Box(!A \land !B)

Read as: open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Means: open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Equation form expr-b3fe98e1db720b4d

B=□C!B = \Box!C

Read as: formula B equals box formula C

Means: formula B equals box formula C

Equation form expr-b5c1f4a7b21c9554

□(A→(B→(A∧B)))\Box(!A \lif (!B \lif (!A \land !B)))

Read as: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Means: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Equation form expr-b691f35f3ec733f5

KT5⊢□A→□□A\Log{KT5} \Proves \Box!A \lif \Box\Box!A

Read as: modal system K T five derives box formula A implies box box formula A

Means: modal system K T five derives box formula A implies box box formula A

Equation form expr-b6bb0344fc788375

{◇p,□◇p→q,¬q}\{ \Diamond p, \Box\Diamond p \lif q, \lnot q \}

Read as: open set diamond propositional variable p comma box diamond propositional variable p implies propositional variable q comma not propositional variable q close set

Means: open set diamond propositional variable p comma box diamond propositional variable p implies propositional variable q comma not propositional variable q close set

Equation form expr-b77169ba82bdbcc1

K⊢(□A∧□B)→□(A∧B)\Log{K} \Proves (\Box!A \land \Box!B) \lif \Box(!A \land !B)

Read as: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Means: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis

Equation form expr-b86d664e9d04a1d1

KT5⊢◇□A→□◇□A\Log{KT5} \Proves \Diamond\Box!A \lif \Box\Diamond\Box!A

Read as: modal system K T five derives diamond box formula A implies box diamond box formula A

Means: modal system K T five derives diamond box formula A implies box diamond box formula A

Equation form expr-ba33b91da534d9ab

C→B!C \lif !B

Read as: formula C implies formula B

Means: formula C implies formula B

Equation form expr-ba72b23ae60a855e

(A∧B)→A(!A \land !B) \lif !A

Read as: open parenthesis formula A and formula B close parenthesis implies formula A

Means: open parenthesis formula A and formula B close parenthesis implies formula A

Equation form expr-baacfd9d189243cd

◇A\Diamond !A

Read as: diamond formula A

Means: diamond formula A

Equation form expr-bafca01030687e8f

K⊢□¬(A∨B)→□¬A\Log{K} \Proves \Box\lnot(!A \lor !B) \lif \Box\lnot!A

Read as: modal system K derives box not open parenthesis formula A or formula B close parenthesis implies box not formula A

Means: modal system K derives box not open parenthesis formula A or formula B close parenthesis implies box not formula A

Equation form expr-bc8b4a672f6adfd1

KTB⊬4\Log{KTB} \Proves/ \Log{4}

Read as: modal system K T B does not derive modal system four

Means: modal system K T B does not derive modal system four

Equation form expr-bc9367794d2761fe

A∈Γ!A \in \Gamma

Read as: formula A belongs to Gamma

Means: formula A belongs to Gamma

Equation form expr-bf4368e84c5c5200

¬◇⊥\lnot\Diamond\lfalse

Read as: not diamond falsity

Means: not diamond falsity

Equation form expr-c0ca760c88f1b93d

□(A→(B→A))\Box(!A \lif (!B \lif !A))

Read as: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis

Means: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis

Equation form expr-c22cf48a730d0251

K4⊈KB\Log{K4} \nsubseteq \Log{KB}

Read as: modal system K four is not a subset of modal system K B

Means: modal system K four is not a subset of modal system K B

Equation form expr-c2f654654c2304a2

□(A→(B→A))→(□A→□(B→A))\Box(!A \lif (!B \lif !A)) \lif (\Box!A \lif \Box(!B \lif !A))

Read as: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies formula A close parenthesis close parenthesis

Means: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies formula A close parenthesis close parenthesis

Equation form expr-c35dad4edbf69089

Σ⊢B1→(B2→⋯(Bn→A)⋯)\Sigma \Proves !B_1 \lif (!B_2 \lif \cdots (!B_n \lif !A) \cdots)

Read as: Sigma derives formula B subscript one implies open parenthesis formula B subscript two implies and so on open parenthesis formula B subscript n implies formula A close parenthesis and so on close parenthesis

Means: Sigma derives formula B subscript one implies open parenthesis formula B subscript two implies and so on open parenthesis formula B subscript n implies formula A close parenthesis and so on close parenthesis

Equation form expr-c36eaa7131fe1ea6

□A→(□B→□(A∧B)))\Box!A \lif (\Box !B \lif \Box(!A \land !B)))

Read as: box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Means: box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis

Equation form expr-c418210dcd66e4ac

K⊢□(A∧B)→(□A∧□B)\Log{K} \Proves \Box(!A \land !B) \lif (\Box !A \land \Box!B)

Read as: modal system K derives box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis

Means: modal system K derives box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis

Equation form expr-c457dbcdd3b49987

w4w_4

Read as: w subscript four

Means: w subscript four

Equation form expr-c4a0ac6cdda65caa

□¬\Box\lnot

Read as: box not

Means: box not

Equation form expr-c530c268d23c02c8

K⊢A1→(A2→⋯(An−1→An)…)\Log{K} \Proves !A_1 \lif (!A_2 \lif \cdots (!A_{n-1} \lif !A_n)\dots)

Read as: modal system K derives formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n - one implies formula A subscript n close parenthesis and so on close parenthesis

Means: modal system K derives formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n - one implies formula A subscript n close parenthesis and so on close parenthesis

Equation form expr-c75e0b4cdbd40d65

Ci\mClass{C}_i

Read as: class C of models subscript i

Means: class C of models subscript i

Equation form expr-c79bef26205fead8

¬◇\lnot\Diamond

Read as: not diamond

Means: not diamond

Equation form expr-c92de1399f3089f9

C∈KA1…An!C \in \Log{K}!A_1 \dots !A_n

Read as: formula C belongs to modal system K formula A subscript one and so on formula A subscript n

Means: formula C belongs to modal system K formula A subscript one and so on formula A subscript n

Equation form expr-c9712394b59a992a

KB5⊢□◇□A→□□A\Log{KB5} \Proves \Box\Diamond\Box!A \lif \Box\Box !A

Read as: modal system K B five derives box diamond box formula A implies box box formula A

Means: modal system K B five derives box diamond box formula A implies box box formula A

Equation form expr-c99941201027b5be

Γ⊢ΣA\Gamma \Proves[\Sigma] !A

Read as: Gamma derives in system Sigma formula A

Means: Gamma derives in system Sigma formula A

Equation form expr-c9dde05108389629

□(A∧B)→(□A∧□B)\Box(!A \land !B) \lif (\Box !A \land \Box!B)

Read as: box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis

Means: box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis

Equation form expr-cc9ce2bc1818217a

KT⊢□A→A\Log{KT} \Proves \Box !A \lif !A

Read as: modal system K T derives box formula A implies formula A

Means: modal system K T derives box formula A implies formula A

Equation form expr-cdc2ed7d3b3d72c2

⊥\lfalse

Read as: falsity

Means: falsity

Equation form expr-cdc98f5ac803e93b

KT⊢A→◇A\Log{KT} \Proves !A \lif \Diamond!A

Read as: modal system K T derives formula A implies diamond formula A

Means: modal system K T derives formula A implies diamond formula A

Equation form expr-cefa278d24370919

K⊢□A→(□¬B→□¬(A→B))\Log{K} \Proves \Box!A \lif (\Box\lnot!B \lif \Box\lnot (!A\lif !B))

Read as: modal system K derives box formula A implies open parenthesis box not formula B implies box not open parenthesis formula A implies formula B close parenthesis close parenthesis

Means: modal system K derives box formula A implies open parenthesis box not formula B implies box not open parenthesis formula A implies formula B close parenthesis close parenthesis

Equation form expr-d055ee4dbcdd0c8b

B!B

Read as: formula B

Means: formula B

Equation form expr-d07113a87d2fa4fa

¬¬p\lnot\lnot p

Read as: not not propositional variable p

Means: not not propositional variable p

Equation form expr-d0a2b90b3d18abd7

M\mModel{M}

Read as: model M

Means: model M

Equation form expr-d252332300cf8bee

Γ∪{A}\Gamma \cup \{ !A \}

Read as: Gamma union open set formula A close set

Means: Gamma union open set formula A close set

Equation form expr-d2cb79dbc568c1a6

K⊢C[A/q]\Log{K} \Proves \Subst{!C}{!A}{q}

Read as: modal system K derives the result of substituting formula A for propositional variable q in formula C

Means: modal system K derives the result of substituting formula A for propositional variable q in formula C

Equation form expr-d43b451130ac883a

KT⊢B\Log{KT} \Proves !B

Read as: modal system K T derives formula B

Means: modal system K T derives formula B

Equation form expr-d4c0a0fee0146d61

{□(p→q),□p,¬□q}\{ \Box(p \lif q), \Box p, \lnot\Box q \}

Read as: open set box open parenthesis propositional variable p implies propositional variable q close parenthesis comma box propositional variable p comma not box propositional variable q close set

Means: open set box open parenthesis propositional variable p implies propositional variable q close parenthesis comma box propositional variable p comma not box propositional variable q close set

Equation form expr-d54fc95b3832ec0d

KA1…An={B:KA1…An⊢B}\Log{K} !A_1 \dots !A_n = \Setabs{!B}{\Log{K} !A_1 \dots !A_n \Proves !B}

Read as: modal system K formula A subscript one and so on formula A subscript n equals the set of formula B such that modal system K formula A subscript one and so on formula A subscript n derives formula B

Means: modal system K formula A subscript one and so on formula A subscript n equals the set of formula B such that modal system K formula A subscript one and so on formula A subscript n derives formula B

Equation form expr-d61252d38c5eba2f

B→C!B \lif !C

Read as: formula B implies formula C

Means: formula B implies formula C

Equation form expr-d65d75b1e6562713

Σ\Sigma

Read as: Sigma

Means: Sigma

Equation form expr-da24afe828450851

KT4⊬B\Log{KT4} \Proves/ \Ax{B}

Read as: modal system K T four does not derive axiom B

Means: modal system K T four does not derive axiom B

Equation form expr-dac2379a7b03b342

KA1…An⊢C\Log{K}!A_1\dots!A_n \Proves !C

Read as: modal system K formula A subscript one and so on formula A subscript n derives formula C

Means: modal system K formula A subscript one and so on formula A subscript n derives formula C

Equation form expr-db3432d1486ff645

A→B∈Σ!A \lif !B \in \Sigma

Read as: formula A implies formula B belongs to Sigma

Means: formula A implies formula B belongs to Sigma

Equation form expr-db52a305090ae209

K⊢□A→(◇(A→B)→◇B)\Log{K}\Proves \Box!A \lif (\Diamond(!A \lif !B) \lif \Diamond !B)

Read as: modal system K derives box formula A implies open parenthesis diamond open parenthesis formula A implies formula B close parenthesis implies diamond formula B close parenthesis

Means: modal system K derives box formula A implies open parenthesis diamond open parenthesis formula A implies formula B close parenthesis implies diamond formula B close parenthesis

Equation form expr-dc7b67a450c5c4ac

k<ik < i

Read as: k is less than i

Means: k is less than i

Equation form expr-dcc90525101f03b4

K⊢◇(A∨B)→(¬◇B→◇A)\Log{K} \Proves \Diamond(!A \lor !B) \lif (\lnot \Diamond!B \lif \Diamond!A)

Read as: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis not diamond formula B implies diamond formula A close parenthesis

Means: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis not diamond formula B implies diamond formula A close parenthesis

Equation form expr-dce1bf6f74513bd5

K⊢¬□¬A→¬□¬(A∨B)\Log{K} \Proves \lnot\Box\lnot !A \lif \lnot\Box\lnot(!A \lor!B)

Read as: modal system K derives not box not formula A implies not box not open parenthesis formula A or formula B close parenthesis

Means: modal system K derives not box not formula A implies not box not open parenthesis formula A or formula B close parenthesis

Equation form expr-dd03d8e24cbef5e2

K⊢B\Log{K} \Proves !B

Read as: modal system K derives formula B

Means: modal system K derives formula B

Equation form expr-dd1b44f4a83297ba

Ci!C_i

Read as: formula C subscript i

Means: formula C subscript i

Equation form expr-dd85ccf5c34e5656

KT5⊢◇A→□◇A\Log{KT5} \Proves \Diamond!A \lif \Box\Diamond!A

Read as: modal system K T five derives diamond formula A implies box diamond formula A

Means: modal system K T five derives diamond formula A implies box diamond formula A

Equation form expr-de64372991421159

An!A_n

Read as: formula A subscript n

Means: formula A subscript n

Equation form expr-de8d2d541234b4f3

□C\Box !C

Read as: box formula C

Means: box formula C

Equation form expr-dea7a7a12c10f4e9

K⊢¬□¬¬p→◇¬p\Log{K} \Proves \lnot \Box \lnot\lnot p \lif \Diamond \lnot p

Read as: modal system K derives not box not not propositional variable p implies diamond not propositional variable p

Means: modal system K derives not box not not propositional variable p implies diamond not propositional variable p

Equation form expr-dffa227108b65500

A1!A_1

Read as: formula A subscript one

Means: formula A subscript one

Equation form expr-e1380a9ed7fd015c

KB5⊢□A→□□A\Log{KB5} \Proves \Box!A \lif \Box\Box!A

Read as: modal system K B five derives box formula A implies box box formula A

Means: modal system K B five derives box formula A implies box box formula A

Equation form expr-e22c886a1252930f

C1\mClass{C}_1

Read as: class C of models subscript one

Means: class C of models subscript one

Equation form expr-e35bf51cc6365a92

K⊢◇(A∨B)→(◇A∨◇B)\Log{K} \Proves \Diamond(!A \lor!B) \lif (\Diamond!A \lor \Diamond!B)

Read as: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula A or diamond formula B close parenthesis

Means: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula A or diamond formula B close parenthesis

Equation form expr-e465c769515a9c81

Δ∪{A}⊢ΣB\Delta \cup \{!A\} \Proves[\Sigma] !B

Read as: Delta union open set formula A close set derives in system Sigma formula B

Means: Delta union open set formula A close set derives in system Sigma formula B

Equation form expr-e4d3411c938d353e

K⊢¬□A→◇¬A\Log{K} \Proves \lnot\Box !A \lif \Diamond \lnot !A

Read as: modal system K derives not box formula A implies diamond not formula A

Means: modal system K derives not box formula A implies diamond not formula A

Equation form expr-e50e42a2d390fcff

C1!C_1

Read as: C subscript one

Means: C subscript one

Equation form expr-e73d34b956cd2003

□((A∧B)→A)\Box((!A \land !B) \lif !A)

Read as: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis

Means: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis

Equation form expr-e779e6010066a063

C(B)!C(!B)

Read as: C open parenthesis formula B close parenthesis

Means: C open parenthesis formula B close parenthesis

Equation form expr-e7f6c011776e8db7

66

Read as: six

Means: six

Equation form expr-e9d180c86baae894

B≡□A!B \ident \Box !A

Read as: formula B is syntactically identical to box formula A

Means: formula B is syntactically identical to box formula A

Equation form expr-eb1cfd0db4a6efc1

(p→q)→((q→r)→(p→r))(p→(q→r))→((p∧q)→r)(p \lif q) & \lif ((q \lif r) \lif (p \lif r)) \\ (p \lif (q \lif r)) & \lif ((p \land q) \lif r)

Read as: Two tautological schemata. First: if p implies q, then if q implies r, then p implies r. Second: if p implies, if q implies r, then if p and q, then r.

Means: Two tautological schemata. First: if p implies q, then if q implies r, then p implies r. Second: if p implies, if q implies r, then if p and q, then r.

Equation form expr-eb70ca682872db12

◇A\Diamond!A

Read as: diamond formula A

Means: diamond formula A

Equation form expr-ecea92bf5007b042

C(A)!C(!A)

Read as: formula C open parenthesis formula A close parenthesis

Means: formula C open parenthesis formula A close parenthesis

Equation form expr-edb7b0e0e2b5ce3c

(p→q)→((p→r)→(p→(q∧r))).(p \lif q) \lif ((p \lif r) \lif (p \lif (q \land r))).

Read as: open parenthesis propositional variable p implies propositional variable q close parenthesis implies open parenthesis open parenthesis propositional variable p implies propositional variable r close parenthesis implies open parenthesis propositional variable p implies open parenthesis propositional variable q and propositional variable r close parenthesis close parenthesis close parenthesis period

Means: open parenthesis propositional variable p implies propositional variable q close parenthesis implies open parenthesis open parenthesis propositional variable p implies propositional variable r close parenthesis implies open parenthesis propositional variable p implies open parenthesis propositional variable q and propositional variable r close parenthesis close parenthesis close parenthesis period

Equation form expr-ee8034d960d5569c

j<ij < i

Read as: j is less than i

Means: j is less than i

Equation form expr-f125bec727d9081e

KB5⊢◇□A→□A\Log{KB5} \Proves \Diamond\Box!A \lif \Box !A

Read as: modal system K B five derives diamond box formula A implies box formula A

Means: modal system K B five derives diamond box formula A implies box formula A

Equation form expr-f157f71e0163a897

□\Box

Read as: box

Means: box

Equation form expr-f28479ca0ee4db1f

⊩□p\mSat{{}}{\Box p}

Read as: the displayed model satisfies box propositional variable p at every world

Means: the displayed model satisfies box propositional variable p at every world

Equation form expr-f2e77153d6d9c7f0

B◇\Ax{B_\Diamond}

Read as: axiom B subscript diamond

Means: axiom B subscript diamond

Equation form expr-f427cdcccd62d1ab

□¬p→□(p→q)\Box \lnot p \lif \Box(p \lif q)

Read as: box not propositional variable p implies box open parenthesis propositional variable p implies propositional variable q close parenthesis

Means: box not propositional variable p implies box open parenthesis propositional variable p implies propositional variable q close parenthesis

Equation form expr-f53e6ebf8be57b90

K⊢A→(¬B→¬(A→B))\Log{K} \Proves !A \lif (\lnot!B \lif \lnot (!A \lif !B))

Read as: modal system K derives formula A implies open parenthesis not formula B implies not open parenthesis formula A implies formula B close parenthesis close parenthesis

Means: modal system K derives formula A implies open parenthesis not formula B implies not open parenthesis formula A implies formula B close parenthesis close parenthesis

Equation form expr-f545575b944a213f

□(¬¬p→p)\Box(\lnot\lnot p \lif p)

Read as: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis

Means: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis

Equation form expr-f5737f6aeb4c1e78

4◇\Ax{4_\Diamond}

Read as: axiom four subscript diamond

Means: axiom four subscript diamond

Equation form expr-f5fcab0ce115697e

A1→(A2→⋯(An→B)⋯)!A_1 \to (!A_2 \lif \cdots (!A_n \lif !B)\cdots)

Read as: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n implies formula B close parenthesis and so on close parenthesis

Means: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n implies formula B close parenthesis and so on close parenthesis

Equation form expr-f65f435afa981240

Frm(L)\Frm[L]

Read as: the set of formulas of language L

Means: the set of formulas of language L

Equation form expr-f6e49c596decc774

KT5⊢4\Log{KT5} \Proves \Ax{4}

Read as: modal system K T five derives axiom four

Means: modal system K T five derives axiom four

Equation form expr-f7cbeb6021713f1e

C(q)!C(q)

Read as: formula C open parenthesis propositional variable q close parenthesis

Means: formula C open parenthesis propositional variable q close parenthesis

Equation form expr-f80eece1214c4a79

D1!D_1

Read as: formula D subscript one

Means: formula D subscript one

Equation form expr-f87a549f62a7a792

□A\Box !A

Read as: box formula A

Means: box formula A

Equation form expr-f95e691abec3021e

(A→B)→((B→C)→(A→C))(!A \lif !B) \lif ((!B \lif !C) \lif (!A \lif !C))

Read as: open parenthesis formula A implies formula B close parenthesis implies open parenthesis open parenthesis formula B implies formula C close parenthesis implies open parenthesis formula A implies formula C close parenthesis close parenthesis

Means: open parenthesis formula A implies formula B close parenthesis implies open parenthesis open parenthesis formula B implies formula C close parenthesis implies open parenthesis formula A implies formula C close parenthesis close parenthesis

Equation form expr-f96630922dfc449a

n=1n = 1

Read as: n equals one

Means: n equals one

Equation form expr-f9ab85ba8196f530

Cn\mClass{C}_n

Read as: class C of models subscript n

Means: class C of models subscript n

Equation form expr-f9e469296b427af3

□p→p\Box p \lif p

Read as: box propositional variable p implies propositional variable p

Means: box propositional variable p implies propositional variable p

Equation form expr-fbcd364a88df16e8

KA1…An\Log{K}!A_1\dots!A_n

Read as: modal system K formula A subscript one and so on formula A subscript n

Means: modal system K formula A subscript one and so on formula A subscript n

Equation form expr-fc43eeb4239b357e

Σ={B:KA1…An⊢B}\Sigma = \Setabs{!B}{\Log{K} !A_1 \dots !A_n \Proves !B }

Read as: Sigma equals the set of formula B such that modal system K formula A subscript one and so on formula A subscript n derives formula B

Means: Sigma equals the set of formula B such that modal system K formula A subscript one and so on formula A subscript n derives formula B

Equation form expr-fd091be747da93e5

KT4⊬5\Log{KT4} \Proves/ \Ax{5}

Read as: modal system K T four does not derive axiom five

Means: modal system K T four does not derive axiom five

Equation form expr-feae71007c657c2c

□A∈Σ\Box !A \in \Sigma

Read as: box formula A belongs to Sigma

Means: box formula A belongs to Sigma

Equation form expr-fef36b264ce11f72

Γ⊢ΣAn\Gamma \Proves[\Sigma] !A_n

Read as: Gamma derives in system Sigma formula A subscript n

Means: Gamma derives in system Sigma formula A subscript n

Equation form expr-ff0ef5c23edbf7bf

B1!B_1

Read as: B subscript one

Means: B subscript one

Equation form expr-ff76b01fde436596

K⊢(□¬B→□¬A)→(¬□¬A→¬□¬B)\Log{K} \Proves (\Box\lnot!B \lif \Box\lnot!A) \lif (\lnot \Box\lnot!A \lif \lnot\Box\lnot!B)

Read as: modal system K derives open parenthesis box not formula B implies box not formula A close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis

Means: modal system K derives open parenthesis box not formula B implies box not formula A close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis

Definition of modus ponens

From A and the conditional from A to B, infer B. The following-from clause identifies the second premise with that conditional; the embedded proof tree records the two ordered premises and conclusion.

Source

Modus ponens inference schema

Source premise node one: formula A. Source premise node two: formula A implies formula B. The next inference is labeled modus ponens. From nodes one, then two, infer node three: formula B. The root conclusion is node three. End proof tree.

Source

Definition of necessitation

From A infer necessarily A. The following-from clause says B follows from A by necessitation exactly when B is syntactically identical to necessarily A.

Source

Necessitation inference schema

Source premise node one: formula A. The next inference is labeled necessitation. From node one, infer node two: box formula A. The root conclusion is node two. End proof tree.

Source

Definition of an axiomatic derivation

A derivation from Sigma is a finite sequence ending in A. Every line is a tautological instance, an instance of an axiom in Sigma, a modus-ponens consequence of two earlier lines, or a necessitation consequence of an earlier line.

Source

Definition of a modal logic

A modal logic contains all tautologies and is closed under uniform substitution and modus ponens. The simultaneous-substitution display preserves the indexed replacement order.

Source

Definition of a normal modal logic

A normal modal logic is a modal logic containing the K schema and the duality schema and closed under necessitation.

Source

K and duality schemata

The first line is K: necessarily, if p then q, implies that necessarily p implies necessarily q. The second is duality: possibly p if and only if not necessarily not p.

Source

Normal modal logics are closed under rule R K

The proposition states an n-ary boxed conditional rule. The proof proceeds by induction, using necessitation for n equals one and K plus propositional reasoning in the step.

Source

Rule R K inference schema

Source premise node one: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n - one implies formula A subscript n close parenthesis and so on close parenthesis. The next inference is labeled rule R K. From node one, infer node two: box formula A subscript one implies open parenthesis box formula A subscript two implies and so on open parenthesis box formula A subscript n - one implies box formula A subscript n close parenthesis and so on close parenthesis period. The root conclusion is node two. End proof tree.

Source

Inductive chain proving rule R K

Four displayed stages retain the nested conditional, the induction-hypothesis boxing, the relevant K instance, and the final fully boxed conditional.

Source

Normal modal logics exclude possible falsity

Every normal modal logic contains not possibly falsity.

Source

Exercise on possible falsity

Prove the preceding proposition that every normal modal logic contains not possibly falsity. The exercise is unsolved.

Source

Existence of the smallest generated modal logic

For any finite list of formulas, there is a smallest normal modal logic containing all their substitution instances, obtained by intersecting all such normal modal logics.

Source

Definition of a modal system

The smallest normal modal logic containing the given formulas is denoted K followed by those formulas. K alone denotes the smallest normal modal logic.

Source

Definition of derivability in a modal system

A formula B is derivable in K extended by A one through A n when a finite sequence ends in B and every line is an allowed axiom instance or follows from earlier lines by modus ponens or necessitation.

Source

Modal-system membership equals derivability

The system K extended by A one through A n is exactly the set of formulas derivable in that system. The proof establishes both inclusions and closure under every defining operation.

Source

Boxed weakening theorem

K derives: if necessarily A, then necessarily, if B then A. The following four-line derivation gives the source proof.

Source

Four-line K proof of boxed weakening

Derivation. Line one: formula A implies open parenthesis formula B implies formula A close parenthesis. Justification: tautological instance. Line two: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis. Justification: necessitation. Line three: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies formula A close parenthesis close parenthesis. Justification: axiom K. Line four: box formula A implies box open parenthesis formula B implies formula A close parenthesis. Justification: modus ponens. End derivation.

Source

Box distributes to both conjuncts

K derives that necessity of A and B implies both necessarily A and necessarily B. The following eleven-line derivation proves the two projections and combines them propositionally.

Source

Eleven-line K proof distributing box over conjunction

Derivation. Line one: open parenthesis formula A and formula B close parenthesis implies formula A. Justification: tautological instance. Line two: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis. Justification: necessitation. Line three: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis. Justification: axiom K. Line four: box open parenthesis formula A and formula B close parenthesis implies box formula A. Justification: modus ponens. Line five: open parenthesis formula A and formula B close parenthesis implies formula B. Justification: tautological instance. Line six: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis. Justification: necessitation. Line seven: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis. Justification: axiom K. Line eight: box open parenthesis formula A and formula B close parenthesis implies box formula B. Justification: modus ponens. Line nine: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis implies open set close set. Justification: tautological instance. Source justification formulas, in order: open parenthesis open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set; then open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis close parenthesis. Line ten: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set. Justification: modus ponens. Source justification formula, in order: open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis. Line eleven: box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis. Justification: modus ponens. End derivation.

Source

Two necessary conjuncts imply their necessary conjunction

K derives that necessarily A and necessarily B together imply necessarily A and B. The following ten-line derivation uses K twice and propositional composition.

Source

Ten-line K proof combining two boxed conjuncts

Derivation. Line one: formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: necessitation. Line three: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: axiom K. Line four: box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: modus ponens. Line five: box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: axiom K. Line six: open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set. Justification: tautological instance. Source justification formulas, in order: open parenthesis box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set; then open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis. Line seven: open parenthesis box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set. Justification: modus ponens. Source justification formula, in order: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Line eight: box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: modus ponens. Line nine: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis implies open set close set. Justification: tautological instance. Source justification formula, in order: open parenthesis open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis close parenthesis. Line ten: open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis. Justification: modus ponens. End derivation.

Source

Two propositional tautologies used in the conjunction proof

The first composes two conditionals; the second turns a nested conditional into a conditional from a conjunction.

Source

Box and diamond under negation

For the complete language with both modalities primitive, K derives that not necessarily p implies possibly not p. The source also prints alternative profile branches, but this canonical projection retains the both-primitive proof.

Source

Twelve-line K proof relating box and diamond under negation

Derivation. Line one: diamond not propositional variable p if and only if not box not not propositional variable p. Justification: duality axiom. Line two: open parenthesis diamond not propositional variable p if and only if not box not not propositional variable p close parenthesis implies open set close set. Justification: tautological instance. Source justification formula, in order: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis. Line three: not box not not propositional variable p implies diamond not propositional variable p. Justification: modus ponens. Line four: not not propositional variable p implies propositional variable p. Justification: tautological instance. Line five: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis. Justification: necessitation. Line six: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis implies open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis. Justification: axiom K. Line seven: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis. Justification: modus ponens. Line eight: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis. Justification: tautological instance. Line nine: not box propositional variable p implies not box not not propositional variable p. Justification: modus ponens. Line ten: open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis implies open set close set. Justification: tautological instance. Source justification formula, in order: open parenthesis open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis close parenthesis. Line eleven: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis. Justification: modus ponens. Line twelve: not box propositional variable p implies diamond not propositional variable p. Justification: modus ponens. End derivation.

Source

Contraposition and transitivity tautologies

The first schema is contraposition. The second composes conditionals. They justify the indicated lines of the preceding modal derivation.

Source

Exercises in K

Find K derivations of three listed modal formulas concerning boxed negation, boxed disjunction, and monotonicity of possibility. No derivations are supplied.

Source

Propositional consequence may be used inside K

If K derives A one through A n and B follows propositionally from them, K derives B. The proof uses the corresponding nested tautological conditional and n applications of modus ponens.

Source

Derived n-ary rule R K

A derivable nested conditional remains derivable after boxing every component. The proof is the same induction as the earlier closure proposition.

Source

Short proof of boxed conjunction

The proposition repeats the result that two boxed conjuncts imply their boxed conjunction, now using the derived rules.

Source

Three-line derived proof combining boxed conjuncts

Derivation. Line one: modal system K derives formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: modal system K derives box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: rule R K. Line three: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis. Justification: propositional logic. End derivation.

Source

Rewriting proposition

Provable equivalence permits replacement of A by B inside a formula context C. The printed conclusion writes B without the source formula marker used elsewhere; that notation is preserved and disclosed.

Source

Exercise proving the rewriting proposition

Prove rewriting by structural induction on C, first establishing equivalence of the two substitution instances. The proof remains unsupplied.

Source

Three-line rewriting-rule abbreviation

Derivation. Unnumbered source line one: derives formula C open parenthesis formula A close parenthesis. Justification: no separate justification is printed. Unnumbered source line two: derives formula A if and only if formula B. Justification: no separate justification is printed. Unnumbered source line three: derives formula C open parenthesis formula B close parenthesis. Justification: the cited rewriting proposition. Source reference: the rewriting proposition. End derivation.

Source

Not-box implies possible negation

K derives that not necessarily p implies possibly not p. The canonical branch uses duality and a final replacement of double negation by p.

Source

Three-line proof of not-box implying possible negation

Derivation. Line one: modal system K derives diamond not propositional variable p if and only if not box not not propositional variable p. Justification: duality axiom. Line two: modal system K derives not box not not propositional variable p implies diamond not propositional variable p. Justification: propositional logic. Line three: modal system K derives not box propositional variable p implies diamond not propositional variable p. Justification: the source-listed replacement. Source justification formulas, in order: propositional variable p; then not not propositional variable p. End derivation.

Source

Expanded final rewriting step

Derivation. Unnumbered source line one: modal system K derives not box not not propositional variable p implies diamond not propositional variable p. Justification: no separate justification is printed. Unnumbered source line two: modal system K derives not not propositional variable p if and only if propositional variable p. Justification: tautological instance. Unnumbered source line three: modal system K derives not box propositional variable p implies diamond not propositional variable p. Justification: the cited rewriting proposition. Source reference: the rewriting proposition. End derivation.

Source

Uniform substitution preserves derivability

Every substitution instance of a K theorem is again a K theorem. The proof checks axiom instances and both inference rules by induction on derivation length.

Source

Boxed implication preserves possibility

K derives that necessity of A implies B entails that possibility of A implies possibility of B.

Source

Five-line proof that box preserves diamond implication

Derivation. Line one: modal system K derives open parenthesis formula A implies formula B close parenthesis implies open parenthesis not formula B implies not formula A close parenthesis. Justification: propositional logic. Line two: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis box not formula B implies box not formula A close parenthesis. Justification: rule R K. Line three: modal system K derives open parenthesis box not formula B implies box not formula A close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis. Justification: tautological instance. Line four: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis. Justification: propositional logic. Line five: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis diamond formula A implies diamond formula B close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. End derivation.

Source

A boxed antecedent and possible conditional yield a possible consequent

K derives: if necessarily A, then if A implies B is possible, B is possible.

Source

Four-line mixed box-and-diamond implication proof

Derivation. Line one: modal system K derives formula A implies open parenthesis not formula B implies not open parenthesis formula A implies formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: modal system K derives box formula A implies open parenthesis box not formula B implies box not open parenthesis formula A implies formula B close parenthesis close parenthesis. Justification: rule R K. Line three: modal system K derives box formula A implies open parenthesis not box not open parenthesis formula A implies formula B close parenthesis implies not box not formula B close parenthesis. Justification: propositional logic. Line four: modal system K derives box formula A implies open parenthesis diamond open parenthesis formula A implies formula B close parenthesis implies diamond formula B close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. End derivation.

Source

Either possible disjunct makes the disjunction possible

K derives that possibly A or possibly B implies possibly A or B.

Source

Six-line proof that possibility is monotone over disjunction

Derivation. Line one: modal system K derives not open parenthesis formula A or formula B close parenthesis implies not formula A. Justification: tautological instance. Line two: modal system K derives box not open parenthesis formula A or formula B close parenthesis implies box not formula A. Justification: rule R K. Line three: modal system K derives not box not formula A implies not box not open parenthesis formula A or formula B close parenthesis. Justification: propositional logic. Line four: modal system K derives diamond formula A implies diamond open parenthesis formula A or formula B close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. Line five: modal system K derives diamond formula B implies diamond open parenthesis formula A or formula B close parenthesis. Justification: the analogous preceding argument. Line six: modal system K derives open parenthesis diamond formula A or diamond formula B close parenthesis implies diamond open parenthesis formula A or formula B close parenthesis. Justification: propositional logic. End derivation.

Source

Possibility distributes over disjunction

K derives that possibility of A or B implies possibly A or possibly B. The source proof ends in the reversed disjunct order, which is propositionally equivalent to the stated result.

Source

Seven-line proof that possibility distributes over disjunction

Derivation. Line one: modal system K derives not formula A implies open parenthesis not formula B implies not open parenthesis formula A or formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: modal system K derives box not formula A implies open parenthesis box not formula B implies box not open parenthesis formula A or formula B close parenthesis close parenthesis. Justification: rule R K. Line three: modal system K derives box not formula A implies open parenthesis not box not open parenthesis formula A or formula B close parenthesis implies not box not formula B close parenthesis. Justification: propositional logic. Line four: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis box not formula A implies not box not formula B close parenthesis. Justification: propositional logic. Line five: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis not not box not formula B implies not box not formula A close parenthesis. Justification: propositional logic. Line six: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis not diamond formula B implies diamond formula A close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. Line seven: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula B or diamond formula A close parenthesis. Justification: propositional logic. End derivation.

Source

Exercises on derived K proofs

Show three listed claims about possibility of truth, a boxed disjunction, and converting a possible-to-necessary premise into a boxed implication. The exercises remain unsolved.

Source

Definition of the dual modal schemata

The display gives T diamond, B diamond, four diamond, and five diamond in that order, then explains how contraposition and dual replacement obtain them from their box counterparts.

Source

Four dual schemata

T diamond is p implies possibly p. B diamond is possibly necessarily p implies p. Four diamond contracts two possibilities to one. Five diamond takes possibly necessarily p to necessarily p.

Source

A modal schema and its dual generate the same system

For each listed schema A, K extended by A equals K extended by its diamond dual.

Source

Exercise on dual modal systems

Prove that adjoining each modal schema or its dual produces the same modal system. No proof is supplied.

Source

Six derivability facts among modal systems

The proposition lists derivations of B and four in K T five, T in K D B four, five in K B four, four in K B five, and D in K T.

Source

Three-line K T five proof of axiom B

Derivation. Line one: modal system K T five derives diamond formula A implies box diamond formula A. Justification: axiom five. Line two: modal system K T five derives formula A implies diamond formula A. Justification: axiom T subscript diamond. Source justification formula, in order: axiom T subscript diamond. Line three: modal system K T five derives formula A implies box diamond formula A. Justification: propositional logic. End derivation.

Source

Six-line K T five proof of axiom four

Derivation. Line one: modal system K T five derives diamond box formula A implies box diamond box formula A. Justification: axiom five; the source-listed replacement. Source justification formulas, in order: box formula A; then propositional variable p. Line two: modal system K T five derives box formula A implies diamond box formula A. Justification: axiom T subscript diamond; the source-listed replacement. Source justification formulas, in order: axiom T subscript diamond; then box formula A; then propositional variable p. Line three: modal system K T five derives box formula A implies box diamond box formula A. Justification: propositional logic. Line four: modal system K T five derives diamond box formula A implies box formula A. Justification: axiom five subscript diamond. Source justification formula, in order: axiom five subscript diamond. Line five: modal system K T five derives box diamond box formula A implies box box formula A. Justification: rule R K. Line six: modal system K T five derives box formula A implies box box formula A. Justification: propositional logic. End derivation.

Source

Five-line K D B four proof of axiom T

Derivation. Line one: modal system K D B four derives diamond box formula A implies formula A. Justification: axiom B subscript diamond. Source justification formula, in order: axiom B subscript diamond. Line two: modal system K D B four derives box box formula A implies diamond box formula A. Justification: axiom D; the source-listed replacement. Source justification formulas, in order: axiom D; then box formula A; then propositional variable p. Line three: modal system K D B four derives box box formula A implies formula A. Justification: propositional logic. Line four: modal system K D B four derives box formula A implies box box formula A. Justification: axiom four. Line five: modal system K D B four derives box formula A implies formula A. Justification: propositional logic. End derivation.

Source

Four-line K B four proof of axiom five

Derivation. Line one: modal system K B four derives diamond formula A implies box diamond diamond formula A. Justification: axiom B; the source-listed replacement. Source justification formulas, in order: diamond formula A; then propositional variable p. Line two: modal system K B four derives diamond diamond formula A implies diamond formula A. Justification: axiom four subscript diamond. Source justification formula, in order: axiom four subscript diamond. Line three: modal system K B four derives box diamond diamond formula A implies box diamond formula A. Justification: rule R K. Line four: modal system K B four derives diamond formula A implies box diamond formula A. Justification: propositional logic. End derivation.

Source

Four-line K B five proof of axiom four

Derivation. Line one: modal system K B five derives box formula A implies box diamond box formula A. Justification: axiom B; the source-listed replacement. Source justification formulas, in order: box formula A; then propositional variable p. Line two: modal system K B five derives diamond box formula A implies box formula A. Justification: axiom five subscript diamond. Source justification formula, in order: axiom five subscript diamond. Line three: modal system K B five derives box diamond box formula A implies box box formula A. Justification: rule R K. Line four: modal system K B five derives box formula A implies box box formula A. Justification: propositional logic. End derivation.

Source

Three-line K T proof of axiom D

Derivation. Line one: modal system K T derives box formula A implies formula A. Justification: axiom T. Line two: modal system K T derives formula A implies diamond formula A. Justification: axiom T subscript diamond. Source justification formula, in order: axiom T subscript diamond. Line three: modal system K T derives box formula A implies diamond formula A. Justification: propositional logic. End derivation.

Source

Definitions of S four and S five

S four is defined as K T four, and S five as K T B four.

Source

Equivalent axiomatizations of S five

The systems K T B four, K T five, K D B four, and K D B five are equal.

Source

Exercise proving the S-five equivalences

Prove the preceding equality of four axiomatizations of S five. The proof remains the source word Exercise.

Source

Soundness theorem for modal systems

If each added axiom family is valid in its corresponding class of models, every theorem of the combined modal system is valid in the intersection of those classes. The proof is by induction on proof length.

Source

K D is a proper subsystem of K T

The inclusion follows because K T derives D. Properness follows from a serial countermodel to T and soundness. The source writes modal system D where the cited result is axiom D; that notation is preserved and disclosed.

Source

K B differs from K four

A two-world symmetric model falsifies axiom four, showing K four is not a subset of K B.

Source

Figure: symmetric countermodel to axiom four

The figure contains the complete two-world directed graph and its printed valuation and modal-truth annotations. The nested graph structure supplies every node and arrow.

Source

Two-world symmetric countermodel to axiom four

Model graph. World w subscript one has valuation propositional variable p is printed false at this world. Its printed claims are the displayed model satisfies box propositional variable p at every world and the displayed model does not satisfy box box propositional variable p at every world. World w subscript two has valuation propositional variable p is printed true at this world. Its printed claim is the displayed model does not satisfy box propositional variable p at every world. There is one directed arrow from w one to w two and one from w two to w one; no loops or other arrows are printed. End model graph.

Source

K T B derives neither four nor five

A single reflexive symmetric model contains failures of an instance of axiom four and an instance of axiom five. The theorem prints modal-system symbols four and five in the non-derivability displays; that source notation is retained.

Source

Figure: reflexive symmetric countermodel to four and five

The figure contains three worlds, a reflexive loop at each, four cross-world arrows, valuations, and all printed modal claims.

Source

Three-world reflexive symmetric countermodel to axioms four and five

Model graph. World w subscript one has valuation propositional variable p is printed true at this world. Its printed claims, in order, are the displayed model satisfies box propositional variable p at every world, the displayed model does not satisfy box box propositional variable p at every world, and the displayed model does not satisfy diamond not propositional variable p at every world. World w subscript two has valuation propositional variable p is printed true at this world. Its claims are the displayed model satisfies diamond not propositional variable p at every world and the displayed model does not satisfy box diamond not propositional variable p at every world. World w subscript three has valuation propositional variable p is printed false at this world. Each world has a reflexive loop. The remaining arrows are w one to w two, w two to w three, w three to w two, and w two to w one. End model graph.

Source

K D five differs from S four

A serial Euclidean four-world model falsifies axiom four, so K D five is not K T four, which is S four.

Source

Figure: serial Euclidean countermodel to axiom four

The figure contains four worlds, three reflexive loops, eight directed cross-world arrows, valuations, and the printed box and double-box claims at w one.

Source

Four-world serial Euclidean countermodel to axiom four

Model graph. World w subscript two has valuation propositional variable p is printed true at this world. World w subscript one has valuation propositional variable p is printed false at this world and carries the two printed claims the displayed model satisfies box propositional variable p at every world comma the displayed model does not satisfy box box propositional variable p at every world. World w subscript three has valuation propositional variable p is printed true at this world. World w subscript four has valuation propositional variable p is printed false at this world. Worlds w two, w three, and w four each have a reflexive loop and arrows in both directions between every distinct pair among them. World w one has arrows to w two and w three only. No other arrows are printed. End model graph.

Source

Exercise seeking a three-world countermodel

Give an alternative proof that K D five differs from S four using a model with three worlds. No model is supplied.

Source

Exercise seeking one S-four countermodel to B and five

Provide one reflexive transitive model showing that K T four derives neither axiom B nor axiom five. No model is supplied.

Source

Definition of derivability from a set

Gamma derives A in modal system Sigma exactly when finitely many formulas B one through B n from Gamma form a nested conditional to A that Sigma derives.

Source

Five properties of derivability from a set

The proposition states monotonicity, reflexivity, cut, the deduction theorem, and propositional rule T for derivability relative to a modal system.

Source

Definition of deductive closure

Gamma is deductively closed relative to Sigma when every formula derivable from Gamma in Sigma already belongs to Gamma.

Source

Definition of relative consistency

Gamma is Sigma-consistent exactly when falsity is not derivable from Gamma in Sigma.

Source

Three consistency facts

Consistency is equivalent to failure to derive some formula; derivability of A is equivalent to inconsistency after adjoining not A; and every consistent set has at least one consistent extension by A or not A.

Source

Cross-reference reference-000973

the proposition that no normal modal logic permits possibly falsity

Source occurrence

Cross-reference reference-000974

the table of valid and invalid modal schemata

Source occurrence

Cross-reference reference-000975

the proposition that every normal modal logic is closed under rule R K

Source occurrence

Cross-reference reference-000976

the rewriting proposition

Source occurrence

Cross-reference reference-000977

the rewriting proposition

Source occurrence

Cross-reference reference-000978

the rewriting proposition

Source occurrence

Cross-reference reference-000979

the rewriting proposition

Source occurrence

Cross-reference reference-000980

the rewriting proposition

Source occurrence

Cross-reference reference-000981

the rewriting proposition

Source occurrence

Cross-reference reference-000982

the section on derived rules

Source occurrence

Cross-reference reference-000983

the definition of the dual modal schemata

Source occurrence

Cross-reference reference-000984

the proposition that adjoining a schema or its dual gives the same modal system

Source occurrence

Cross-reference reference-000985

the proposition characterizing equivalence relations

Source occurrence

Cross-reference reference-000986

the proposition giving equivalent axiomatizations of S five

Source occurrence

Cross-reference reference-000987

the proposition that tautological instances are valid

Source occurrence

Cross-reference reference-000988

the proposition that axiom K is valid

Source occurrence

Cross-reference reference-000989

the proposition that the duality schema is valid

Source occurrence

Cross-reference reference-000990

the proposition preserving validity under subclasses of models

Source occurrence

Cross-reference reference-000991

the soundness of modus ponens

Source occurrence

Cross-reference reference-000992

the validity-preservation rule for necessitation

Source occurrence

Cross-reference reference-000993

the section on proofs in modal systems

Source occurrence

Cross-reference reference-000994

the soundness theorem for modal systems

Source occurrence

Cross-reference reference-000995

the proposition listing modal-system derivability facts

Source occurrence

Cross-reference reference-000996

the item stating that K T derives axiom D

Source occurrence

Cross-reference reference-000997

the soundness theorem for modal systems

Source occurrence

Cross-reference reference-000998

the symmetric countermodel to axiom four

Source occurrence

Cross-reference reference-000999

the proposition that axiom K is valid

Source occurrence

Cross-reference reference-001000

the theorem connecting modal schemata with accessibility conditions

Source occurrence

Cross-reference reference-001001

the theorem connecting modal schemata with accessibility conditions

Source occurrence

Cross-reference reference-001002

the reflexive symmetric countermodel to axioms four and five

Source occurrence

Cross-reference reference-001003

the theorem that K T B derives neither axiom four nor axiom five

Source occurrence

Cross-reference reference-001004

the theorem connecting modal schemata with accessibility conditions

Source occurrence

Cross-reference reference-001005

the serial Euclidean countermodel to axiom four

Source occurrence

Cross-reference reference-001006

the theorem distinguishing K D five from S four

Source occurrence

Cross-reference reference-001007

the theorem distinguishing K D five from S four

Source occurrence

Cross-reference reference-001008

the section on proofs in modal systems

Source occurrence

Cross-reference reference-001009

the rule-T item among the derivability properties

Source occurrence

Cross-reference reference-001010

the proposition listing derivability properties

Source occurrence

Cross-reference reference-001011

the consistency-extension item

Source occurrence

Cross-reference reference-001012

the consistency characterization by adjoining a negation

Source occurrence

Cross-reference reference-001013

the proposition listing derivability properties

Source occurrence

Cross-reference reference-001014

the rule-T item among the derivability properties

Source occurrence

Source disclosures

Source-generated case expression tr052-source-macro-0001

MP\MP

Read as: modus ponens

Read in context source

Source-generated case expression tr052-source-macro-0002

nec\Nec

Read as: necessitation

Read in context source

Source-generated case expression tr052-source-macro-0003

RK\RK

Read as: rule R K

Read in context source

Source-generated case expression tr052-source-macro-0004

¬p\mFalse{p}

Read as: propositional variable p is printed false at this world

Read in context source

Source-generated case expression tr052-source-macro-0005

p\mTrue{p}

Read as: propositional variable p is printed true at this world

Read in context source

Source-generated case expression tr052-source-macro-0006

p\mTrue{p}

Read as: propositional variable p is printed true at this world

Read in context source

Source-generated case expression tr052-source-macro-0007

p\mTrue{p}

Read as: propositional variable p is printed true at this world

Read in context source

Source-generated case expression tr052-source-macro-0008

¬p\mFalse{p}

Read as: propositional variable p is printed false at this world

Read in context source

Source-generated case expression tr052-source-macro-0009

p\mTrue{p}

Read as: propositional variable p is printed true at this world

Read in context source

Source-generated case expression tr052-source-macro-0010

¬p\mFalse{p}

Read as: propositional variable p is printed false at this world

Read in context source

Source-generated case expression tr052-source-macro-0011

p\mTrue{p}

Read as: propositional variable p is printed true at this world

Read in context source

Source-generated case expression tr052-source-macro-0012

¬p\mFalse{p}

Read as: propositional variable p is printed false at this world

Read in context source

Ordered structures

Modus ponens inference schema

Structure: proof tree.

Source premise node one: formula A. Source premise node two: formula A implies formula B. The next inference is labeled modus ponens. From nodes one, then two, infer node three: formula B. The root conclusion is node three. End proof tree.

Read the source-bound structure in context

Necessitation inference schema

Structure: proof tree.

Source premise node one: formula A. The next inference is labeled necessitation. From node one, infer node two: box formula A. The root conclusion is node two. End proof tree.

Read the source-bound structure in context

Rule R K inference schema

Structure: proof tree.

Source premise node one: formula A subscript one implies open parenthesis formula A subscript two implies and so on open parenthesis formula A subscript n - one implies formula A subscript n close parenthesis and so on close parenthesis. The next inference is labeled rule R K. From node one, infer node two: box formula A subscript one implies open parenthesis box formula A subscript two implies and so on open parenthesis box formula A subscript n - one implies box formula A subscript n close parenthesis and so on close parenthesis period. The root conclusion is node two. End proof tree.

Read the source-bound structure in context

Four-line K proof of boxed weakening

Structure: derivation.

Derivation. Line one: formula A implies open parenthesis formula B implies formula A close parenthesis. Justification: tautological instance. Line two: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis. Justification: necessitation. Line three: box open parenthesis formula A implies open parenthesis formula B implies formula A close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies formula A close parenthesis close parenthesis. Justification: axiom K. Line four: box formula A implies box open parenthesis formula B implies formula A close parenthesis. Justification: modus ponens. End derivation.

Read the source-bound structure in context

Eleven-line K proof distributing box over conjunction

Structure: derivation.

Derivation. Line one: open parenthesis formula A and formula B close parenthesis implies formula A. Justification: tautological instance. Line two: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis. Justification: necessitation. Line three: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula A close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis. Justification: axiom K. Line four: box open parenthesis formula A and formula B close parenthesis implies box formula A. Justification: modus ponens. Line five: open parenthesis formula A and formula B close parenthesis implies formula B. Justification: tautological instance. Line six: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis. Justification: necessitation. Line seven: box open parenthesis open parenthesis formula A and formula B close parenthesis implies formula B close parenthesis implies open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis. Justification: axiom K. Line eight: box open parenthesis formula A and formula B close parenthesis implies box formula B. Justification: modus ponens. Line nine: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula A close parenthesis implies open set close set. Justification: tautological instance. Source justification formulas, in order: open parenthesis open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set; then open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis close parenthesis. Line ten: open parenthesis box open parenthesis formula A and formula B close parenthesis implies box formula B close parenthesis implies open set close set. Justification: modus ponens. Source justification formula, in order: open parenthesis box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis close parenthesis. Line eleven: box open parenthesis formula A and formula B close parenthesis implies open parenthesis box formula A and box formula B close parenthesis. Justification: modus ponens. End derivation.

Read the source-bound structure in context

Ten-line K proof combining two boxed conjuncts

Structure: derivation.

Derivation. Line one: formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: necessitation. Line three: box open parenthesis formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: axiom K. Line four: box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: modus ponens. Line five: box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: axiom K. Line six: open parenthesis box formula A implies box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set. Justification: tautological instance. Source justification formulas, in order: open parenthesis box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set; then open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis. Line seven: open parenthesis box open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis implies open set close set. Justification: modus ponens. Source justification formula, in order: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Line eight: box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: modus ponens. Line nine: open parenthesis box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis close parenthesis implies open set close set. Justification: tautological instance. Source justification formula, in order: open parenthesis open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis close parenthesis. Line ten: open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis. Justification: modus ponens. End derivation.

Read the source-bound structure in context

Twelve-line K proof relating box and diamond under negation

Structure: derivation.

Derivation. Line one: diamond not propositional variable p if and only if not box not not propositional variable p. Justification: duality axiom. Line two: open parenthesis diamond not propositional variable p if and only if not box not not propositional variable p close parenthesis implies open set close set. Justification: tautological instance. Source justification formula, in order: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis. Line three: not box not not propositional variable p implies diamond not propositional variable p. Justification: modus ponens. Line four: not not propositional variable p implies propositional variable p. Justification: tautological instance. Line five: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis. Justification: necessitation. Line six: box open parenthesis not not propositional variable p implies propositional variable p close parenthesis implies open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis. Justification: axiom K. Line seven: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis. Justification: modus ponens. Line eight: open parenthesis box not not propositional variable p implies box propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis. Justification: tautological instance. Line nine: not box propositional variable p implies not box not not propositional variable p. Justification: modus ponens. Line ten: open parenthesis not box propositional variable p implies not box not not propositional variable p close parenthesis implies open set close set. Justification: tautological instance. Source justification formula, in order: open parenthesis open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis close parenthesis. Line eleven: open parenthesis not box not not propositional variable p implies diamond not propositional variable p close parenthesis implies open parenthesis not box propositional variable p implies diamond not propositional variable p close parenthesis. Justification: modus ponens. Line twelve: not box propositional variable p implies diamond not propositional variable p. Justification: modus ponens. End derivation.

Read the source-bound structure in context

Three-line derived proof combining boxed conjuncts

Structure: derivation.

Derivation. Line one: modal system K derives formula A implies open parenthesis formula B implies open parenthesis formula A and formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: modal system K derives box formula A implies open parenthesis box formula B implies box open parenthesis formula A and formula B close parenthesis close parenthesis close parenthesis. Justification: rule R K. Line three: modal system K derives open parenthesis box formula A and box formula B close parenthesis implies box open parenthesis formula A and formula B close parenthesis. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Three-line rewriting-rule abbreviation

Structure: derivation.

Derivation. Unnumbered source line one: derives formula C open parenthesis formula A close parenthesis. Justification: no separate justification is printed. Unnumbered source line two: derives formula A if and only if formula B. Justification: no separate justification is printed. Unnumbered source line three: derives formula C open parenthesis formula B close parenthesis. Justification: the cited rewriting proposition. Source reference: the rewriting proposition. End derivation.

Read the source-bound structure in context

Three-line proof of not-box implying possible negation

Structure: derivation.

Derivation. Line one: modal system K derives diamond not propositional variable p if and only if not box not not propositional variable p. Justification: duality axiom. Line two: modal system K derives not box not not propositional variable p implies diamond not propositional variable p. Justification: propositional logic. Line three: modal system K derives not box propositional variable p implies diamond not propositional variable p. Justification: the source-listed replacement. Source justification formulas, in order: propositional variable p; then not not propositional variable p. End derivation.

Read the source-bound structure in context

Expanded final rewriting step

Structure: derivation.

Derivation. Unnumbered source line one: modal system K derives not box not not propositional variable p implies diamond not propositional variable p. Justification: no separate justification is printed. Unnumbered source line two: modal system K derives not not propositional variable p if and only if propositional variable p. Justification: tautological instance. Unnumbered source line three: modal system K derives not box propositional variable p implies diamond not propositional variable p. Justification: the cited rewriting proposition. Source reference: the rewriting proposition. End derivation.

Read the source-bound structure in context

Five-line proof that box preserves diamond implication

Structure: derivation.

Derivation. Line one: modal system K derives open parenthesis formula A implies formula B close parenthesis implies open parenthesis not formula B implies not formula A close parenthesis. Justification: propositional logic. Line two: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis box not formula B implies box not formula A close parenthesis. Justification: rule R K. Line three: modal system K derives open parenthesis box not formula B implies box not formula A close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis. Justification: tautological instance. Line four: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis not box not formula A implies not box not formula B close parenthesis. Justification: propositional logic. Line five: modal system K derives box open parenthesis formula A implies formula B close parenthesis implies open parenthesis diamond formula A implies diamond formula B close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. End derivation.

Read the source-bound structure in context

Four-line mixed box-and-diamond implication proof

Structure: derivation.

Derivation. Line one: modal system K derives formula A implies open parenthesis not formula B implies not open parenthesis formula A implies formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: modal system K derives box formula A implies open parenthesis box not formula B implies box not open parenthesis formula A implies formula B close parenthesis close parenthesis. Justification: rule R K. Line three: modal system K derives box formula A implies open parenthesis not box not open parenthesis formula A implies formula B close parenthesis implies not box not formula B close parenthesis. Justification: propositional logic. Line four: modal system K derives box formula A implies open parenthesis diamond open parenthesis formula A implies formula B close parenthesis implies diamond formula B close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. End derivation.

Read the source-bound structure in context

Six-line proof that possibility is monotone over disjunction

Structure: derivation.

Derivation. Line one: modal system K derives not open parenthesis formula A or formula B close parenthesis implies not formula A. Justification: tautological instance. Line two: modal system K derives box not open parenthesis formula A or formula B close parenthesis implies box not formula A. Justification: rule R K. Line three: modal system K derives not box not formula A implies not box not open parenthesis formula A or formula B close parenthesis. Justification: propositional logic. Line four: modal system K derives diamond formula A implies diamond open parenthesis formula A or formula B close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. Line five: modal system K derives diamond formula B implies diamond open parenthesis formula A or formula B close parenthesis. Justification: the analogous preceding argument. Line six: modal system K derives open parenthesis diamond formula A or diamond formula B close parenthesis implies diamond open parenthesis formula A or formula B close parenthesis. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Seven-line proof that possibility distributes over disjunction

Structure: derivation.

Derivation. Line one: modal system K derives not formula A implies open parenthesis not formula B implies not open parenthesis formula A or formula B close parenthesis close parenthesis. Justification: tautological instance. Line two: modal system K derives box not formula A implies open parenthesis box not formula B implies box not open parenthesis formula A or formula B close parenthesis close parenthesis. Justification: rule R K. Line three: modal system K derives box not formula A implies open parenthesis not box not open parenthesis formula A or formula B close parenthesis implies not box not formula B close parenthesis. Justification: propositional logic. Line four: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis box not formula A implies not box not formula B close parenthesis. Justification: propositional logic. Line five: modal system K derives not box not open parenthesis formula A or formula B close parenthesis implies open parenthesis not not box not formula B implies not box not formula A close parenthesis. Justification: propositional logic. Line six: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis not diamond formula B implies diamond formula A close parenthesis. Justification: the source-listed replacement. Source justification formulas, in order: diamond; then not box not. Line seven: modal system K derives diamond open parenthesis formula A or formula B close parenthesis implies open parenthesis diamond formula B or diamond formula A close parenthesis. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Three-line K T five proof of axiom B

Structure: derivation.

Derivation. Line one: modal system K T five derives diamond formula A implies box diamond formula A. Justification: axiom five. Line two: modal system K T five derives formula A implies diamond formula A. Justification: axiom T subscript diamond. Source justification formula, in order: axiom T subscript diamond. Line three: modal system K T five derives formula A implies box diamond formula A. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Six-line K T five proof of axiom four

Structure: derivation.

Derivation. Line one: modal system K T five derives diamond box formula A implies box diamond box formula A. Justification: axiom five; the source-listed replacement. Source justification formulas, in order: box formula A; then propositional variable p. Line two: modal system K T five derives box formula A implies diamond box formula A. Justification: axiom T subscript diamond; the source-listed replacement. Source justification formulas, in order: axiom T subscript diamond; then box formula A; then propositional variable p. Line three: modal system K T five derives box formula A implies box diamond box formula A. Justification: propositional logic. Line four: modal system K T five derives diamond box formula A implies box formula A. Justification: axiom five subscript diamond. Source justification formula, in order: axiom five subscript diamond. Line five: modal system K T five derives box diamond box formula A implies box box formula A. Justification: rule R K. Line six: modal system K T five derives box formula A implies box box formula A. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Five-line K D B four proof of axiom T

Structure: derivation.

Derivation. Line one: modal system K D B four derives diamond box formula A implies formula A. Justification: axiom B subscript diamond. Source justification formula, in order: axiom B subscript diamond. Line two: modal system K D B four derives box box formula A implies diamond box formula A. Justification: axiom D; the source-listed replacement. Source justification formulas, in order: axiom D; then box formula A; then propositional variable p. Line three: modal system K D B four derives box box formula A implies formula A. Justification: propositional logic. Line four: modal system K D B four derives box formula A implies box box formula A. Justification: axiom four. Line five: modal system K D B four derives box formula A implies formula A. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Four-line K B four proof of axiom five

Structure: derivation.

Derivation. Line one: modal system K B four derives diamond formula A implies box diamond diamond formula A. Justification: axiom B; the source-listed replacement. Source justification formulas, in order: diamond formula A; then propositional variable p. Line two: modal system K B four derives diamond diamond formula A implies diamond formula A. Justification: axiom four subscript diamond. Source justification formula, in order: axiom four subscript diamond. Line three: modal system K B four derives box diamond diamond formula A implies box diamond formula A. Justification: rule R K. Line four: modal system K B four derives diamond formula A implies box diamond formula A. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Four-line K B five proof of axiom four

Structure: derivation.

Derivation. Line one: modal system K B five derives box formula A implies box diamond box formula A. Justification: axiom B; the source-listed replacement. Source justification formulas, in order: box formula A; then propositional variable p. Line two: modal system K B five derives diamond box formula A implies box formula A. Justification: axiom five subscript diamond. Source justification formula, in order: axiom five subscript diamond. Line three: modal system K B five derives box diamond box formula A implies box box formula A. Justification: rule R K. Line four: modal system K B five derives box formula A implies box box formula A. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Three-line K T proof of axiom D

Structure: derivation.

Derivation. Line one: modal system K T derives box formula A implies formula A. Justification: axiom T. Line two: modal system K T derives formula A implies diamond formula A. Justification: axiom T subscript diamond. Source justification formula, in order: axiom T subscript diamond. Line three: modal system K T derives box formula A implies diamond formula A. Justification: propositional logic. End derivation.

Read the source-bound structure in context

Two-world symmetric countermodel to axiom four

Structure: diagram tikz.

Model graph. World w subscript one has valuation propositional variable p is printed false at this world. Its printed claims are the displayed model satisfies box propositional variable p at every world and the displayed model does not satisfy box box propositional variable p at every world. World w subscript two has valuation propositional variable p is printed true at this world. Its printed claim is the displayed model does not satisfy box propositional variable p at every world. There is one directed arrow from w one to w two and one from w two to w one; no loops or other arrows are printed. End model graph.

Read the source-bound structure in context

Three-world reflexive symmetric countermodel to axioms four and five

Structure: diagram tikz.

Model graph. World w subscript one has valuation propositional variable p is printed true at this world. Its printed claims, in order, are the displayed model satisfies box propositional variable p at every world, the displayed model does not satisfy box box propositional variable p at every world, and the displayed model does not satisfy diamond not propositional variable p at every world. World w subscript two has valuation propositional variable p is printed true at this world. Its claims are the displayed model satisfies diamond not propositional variable p at every world and the displayed model does not satisfy box diamond not propositional variable p at every world. World w subscript three has valuation propositional variable p is printed false at this world. Each world has a reflexive loop. The remaining arrows are w one to w two, w two to w three, w three to w two, and w two to w one. End model graph.

Read the source-bound structure in context

Four-world serial Euclidean countermodel to axiom four

Structure: diagram tikz.

Model graph. World w subscript two has valuation propositional variable p is printed true at this world. World w subscript one has valuation propositional variable p is printed false at this world and carries the two printed claims the displayed model satisfies box propositional variable p at every world comma the displayed model does not satisfy box box propositional variable p at every world. World w subscript three has valuation propositional variable p is printed true at this world. World w subscript four has valuation propositional variable p is printed false at this world. Worlds w two, w three, and w four each have a reflexive loop and arrows in both directions between every distinct pair among them. World w one has arrows to w two and w three only. No other arrows are printed. End model graph.

Read the source-bound structure in context