9 ． 1 集合的概念和表示方法 9．2 集合间的关系和特殊集合 9．3集合的运算 9．4 集合的图形表示法 9．5 集合运算的性质和证明 9．6 有限集合的基数 9．7 集合论公理系统

10．1 二元关系 10．2 关系矩阵和关系图 10．3 关系的逆、合成、限制和象 10．4 关系的性质 10．5 关系的闭包 10．6 等价关系和划分 10．7 相容关系和覆盖 10．8 偏序关系

 关系代数 ◦ 关系运算（选择、投影、连接，除运算）  关系演算 ◦ 以数理逻辑中的谓词演算为基础的。可分为：  元组关系演算语言（get，put等6条语句）  域关系演算语言QBE

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

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

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

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

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