前置

定义

一阶语言的量词只作用到变量上。
二阶语言的量词可作用到变量和谓词上。
  • Symbols of first-order language (一阶语言的符号集):

    • Variables:
    • Individual constants:
    • Predicate letters:
    • Function letters:
    • Punctuation:
    • Connectives: ,
    • Quantifier:
  • Term in :

    1. Variables and individual constants are terms.
    2. If is an -ary function letter in and are terms in , then is a term in .
    3. The set of all terms is generated as in (1) and (2).
  • Atomic formula(原子公式):

    • If is a -ary predicate letter in and are terms in , then is an atomic formula in .
  • Well-formed formula(wfs)(良形公式):

    1. Each atomic formula is a wfs.
    2. If and are wfs in , then , , are wfs in , where is an arbitrary variable.
    3. All wfs are generated as in (1) and (2).
  • In the wf. , we say that is the scope of the quantifier. More generally, when occurs as a subformula of a wf. , we say that the scope of this quantifier in is .

  • An occurrence of the variable in a wf. is said to be bound if it occurs within the scope of a in the wf., or if it is the in a .

  • If an occurrence of a variable is not bound it is said to be free.

  • An interpretation of is a non-empty set (the domain of ) together with

    • a collection of distinguished elements ,
    • a collection of functions on ,
    • a collection of relations on .
  • A valuation in is a function
    with the properties:

    1. for each individual constant of .
    2. , where is any function letter in and are any terms of .
Interpretation只提供变量的变化范围,常量的取值,然后给出函数和关系的具体含义。
即Interpretation把一个合式公式限制成一阶的,只剩下变量可以在$D_{I}$中变化。
Valuation只给term赋值。即给变量赋值。
  • Two valuations and are i-equivalent (i-等价, 记作) if for every .

  • Let be a wf. of and let be an interpretation of . A valuation in is said to satisfy , if it can be shown inductively under the following four conditions:

    1. Atomic case
      satisfies iff the relation

      holds (is true) in .

    2. Negation
      satisfies iff does not satisfy .

    3. Implication
      satisfies iff either

      • satisfies , or
      • satisfies .
    4. Universal quantification
      satisfies iff every valuation that is -equivalent to satisfies .
      (Two valuations are -equivalent when they agree on all variables except possibly .)

  • A wf. is true in an interpretation if every valuation in satisfies .

  • A wf. is false in an interpretation if there is no valuation in which satisfies .

  • We write if is true in . This is read as ” satisfies “.

  • Thus if we take a wf. of and replace each statement letter occurring by a wf. of (replacing the same letter by the same wf. throughout), we shall obtain a wf. of . is called a substitution instance in of .

  • A wf. of is a tautology if it is a substitution instance in of a tautology in .

  • A wf. of is said to be closed if no variable occurs free in .

  • A wf. of is logically valid if is true in every interpretation of .

  • A wf. of is contradictory if is false in every interpretation of .

性质

  1. Substitution Lemma (Valuation Version) Let be a well-formed formula in which the variable occurs free, be a term free for in , be any valuation in the given interpretation , be the valuation that is -equivalent to and satisfies
    Then satisfies iff satisfies
  2. If, in a particular interpretation , the wfs. and is true, then is true in .
  3. Let be a wf. of , and let be an interpretation of . Then if and only if , where is any variable.
  4. Let , be variables in , let be a wfs. of , and let be aninterpretation. Then if and only if .
  5. In an interpretation , a valuation satisfies the formula if and only if there is at least one valuation which is i-equivalent to and which satisfies .
  6. A wf. of which is a tautology is true in any interpretation of
  7. Let be an interpretation of and let be a wfs. of . If and are valuations such that for every free variable of , then satisfies if and only if satisfies .
  8. If is a closed wf. of and is an interpretation of , then either or .