请输入您要查询的字词:

 

单词 SomeTheoremSchemasOfNormalModalLogic
释义

some theorem schemas of normal modal logic


Recall that a normal modal logic is a logic containing all tautologiesMathworldPlanetmath, the schema K

(AB)(AB),

and closed under modus ponensMathworldPlanetmath and necessitation rules. Also, the modal operator diamond is defined as

A:=¬¬A.

Let Λ be any normal modal logic. We write A to mean ΛA, or wff AΛ, or A is a theorem of Λ.

Based on some of the meta-theorems of Λ (see here (http://planetmath.org/SyntacticPropertiesOfANormalModalLogic)), we can easily derive the following theorem schemas:

  1. 1.

    (AB)AB

  2. 2.

    AB(AB)

  3. 3.

    ¬

  4. 4.

    A¬¬A

  5. 5.

    (AB)(AB)

  6. 6.

    (AB)(AB)

  7. 7.

    AB(AB)

  8. 8.

    AB(AB)

  9. 9.

    (AB)AB

  10. 10.

    (AB)AB

  11. 11.

    (AB)AB

Proof.
  1. 1.

    From tautologies ABA and ABB and meta-theorem 1, we get (AB)A and (AB)B. So (AB)AB.

  2. 2.

    From tautology A(B(AB)) and meta-theorem 1, we get

    A(B(AB)).

    From the K instance

    (B(AB))(B(AB))

    and the tautology

    (pq)((q(rs))((pr)s))

    substituting p for A, q for (B(AB)), r for B, and s for (AB), and applying modus ponens twice, we get the result.

  3. 3.

    From the tautology ¬, we have the result by necessitation.

  4. 4.

    All we need is A¬¬A. From tautology A¬¬A, we get A¬¬A by meta-theorem 1. From tautology ¬¬A¬¬¬¬A and the definition of , we get A¬¬A.

  5. 5.

    To show (AB)(AB), it is enough to show (AB)(¬AB), which is enough to show (AB)(¬B¬A), which is enough to show (¬B¬A)(¬B¬A), which is just an instance of K.

  6. 6.

    To show (AB)(AB), it is enough to show ¬(A¬B)(AB), which is enough to show ¬(A¬B)(AB) by 1 and 2, which is enough to show ¬AB(AB), which is just (AB)(AB).

  7. 7.

    To show AB(AB), it is enough to show ¬¬AB(AB), which is enough to show ¬(¬B¬A)(AB), which is enough to show ¬(B¬A)¬¬(AB), which is enough to show ¬(AB)(B¬A), which is enough to show (¬A¬B)(B¬A), which is enough to show (B¬A)(B¬A), which is an instance of K.

  8. 8.

    Since AAB and BAB, A(AB) and B(AB), and therefore AB(AB).

  9. 9.

    By 8, ¬A¬B(¬A¬B), so ¬(¬A¬B)¬(¬A¬B), whence (AB)AB.

  10. 10.

    To show (AB)AB, it is enough to show (¬BA)AB, which is enough to show (¬BA)¬¬BA, or (¬BA)¬BA, an instance of K.

  11. 11.

    From AAB and BAB, we get A(AB) and B(AB), so that AB(AB). On the other hand, from ¬A¬B(¬A¬B), we get ¬(¬A¬B)¬(¬A¬B), or (AB)AB, and the result follows.

Remark. The proofs are condensed for the sake of space. Properly, a formal proof should lay out the sequence of wff’s and their derivations. For example, the proof for #5 is

an instance of K  (¬B¬A)(¬B¬A)(1)
tautology (pq)(¬q¬p)(AB)(¬B¬A)(2)
meta-theorem 1 applied to (2)(AB)(¬B¬A)(3)
law of syllogism on (3) to (1)(AB)(¬B¬A)(4)
definition of (AB)(¬¬B¬A)(5)
definition of (AB)(B¬A)(6)
a tautology pqqpB¬A¬AB(7)
law of syllogism on (7) to (6)(AB)(¬AB)(8)
a tautology p¬¬p¬A¬¬¬A(9)
substitution theorem on (8) by (9)(AB)(¬¬¬AB)(10)
definition of (AB)(¬AB)(11)
definition of (AB)(AB)(12)

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 20:38:26