Axiom Schemata for F Axiom Schema 1 A ∨ A ⊃ A Axiom Schema 2 A ⊃ (B ∨ A) Axiom Schema 3 A ⊃ B ⊃ (C ∨ A ⊃ (B ∨ C)) Axiom Schema 4 ∀xA ⊃ Sxt A where t is a term free for the individual variable x in A Axiom Schema 5 ∀x(A ∨ B) ⊃ (A ∨ ∀xB) provided that x is not free in A

Substitutivity of Equivalence Let A,M and N be wffs and let AMN be the result of replacing M by N at zero or more occurrences (henceforth called designate occurrences) of M in A. 1. AMN is a wff. 2. If |= M ≡ N then |= A ≡ AMN

Theory of Equivalence Relations (A, R) (E1) For all x : xRx. (E2) For all x, y : If xRy then yRx. (E3) For all x, y, z : If xRy and yRz then xRz. Logic in Computer Science – p.2/16

1.(每题2分,共10分)判断题(若正确,则在题前的括号中打√;否则,打): (a)()若合式公式A是永真式当且仅当合式公式B是永真式,则AB是永真式。 (b)()若合式公式A是可满足的,则~A是不可满足的。 (c)()v((,x)y~(,y)是可满足的 (d)()设P是一个由P系统增加单个合式公式pq作为公理所得到的系统,则P是协调的

一、微型计算机系统的组成 二、硬件系统的逻辑结构 三、硬件系统的物理结构 四、软件系统的组成 五 、冯·诺依曼计算机的结构特点 六、计算机的一般工作过程

The primitive symbols of E are those of F, plus the symbol ∃. The formation Rules of E are those of F, plus the following If B is a wff of E and x is an individual variable, then ∃xB is a wff of E. The axiom schemata of E are those of F plus

F= = F + “ = ” + 2 Axiom Schemata Axiom Schema 6 x = x. Axiom Schema 7 x = y ⊃ (SzxA ⊃ SzyA) where A is an atomic wff. A first order theory is a first-order theory with equality if it has a binary predicate = such that the wffs above are theorem of the theory

要解决系统“能做什么”的问题。通过详细 调查研究和需示分析，深入描述及研究现行系 统的工作流程及用户的各种需求，构思和设计 用户比较满意的新系统逻辑模型，并且提出适 当的计算机硬软件配置方案。系统分析阶段工 作的深入与否直接影响新系统的设计质量 和经 济性，在整个系统开发过程中起着极其重要的 作用

Interpretation over a singleton Let I be , and σ ∈ ΣI. 1. I(A)(σ) = I(∀xA)(σ). 2. I(t)(σ) = a. 3. I(Sx1,···,xn t1,···,tn A)(σ) = I(A)(σ). 4. I0(P), σ(P) ∈ {I(n), Ψ(n)} for every n-ary predicate constant (variable), where

Interpretation An interpretation I of F is , where D is a non-empty set called the domain of individuals. I0 is a mapping defined on the constants of F satisfying 1. If c is an individual constant, then I0(c) ∈ D. 2. If f n is an n-ary function constant, then I0(f n) : Dn → D