命题逻辑模型论第一讲

@Chang C C, Keisler H J. Model theory[M]. Elsevier, 1990.

(本系列博客主要介绍《模型论》中的一些基础知识，本意在于加强自身对其的理解，以及希望向阅读该系列博客的人提供一些粗浅的理解以供学习参考。)

时间	题目
@2019年2月27日19:09:29	命题逻辑模型论第一讲

模型论主要是讨论语义和语型之间的关系，而模型就是语义结构。
研究模型论，首先需要明确在哪个语言下讨论。我们首先介绍命题逻辑（propositional logic,也即语句逻辑 sentential logic）

Def The language $L$ (for Propositional Logic)

The language $L$ includes symbols:

1. connections $\wedge$ (and) , $\neg$ (not)
   (*这两个符号是含量完全的，可表示其他的连接词，例如 $\vee$,$\to$ *等)
2. parenthesis ( , ) (*只是为了阅读方便，如规定好连接词的优先级，可以省略等)
3. a non-empty set $\mathcal{L}$ of sentence symbols, e.g. Ls={p,q,r,…}
   Note that: p,q,r are symbols, they represent relevant propositions, they are not propositions)

（*上述符号经过任意多次组合之后，形成的语言集合为L*）

Def Well-Formed Formula, WFF (*合取范式)

The BNF syntax of WFF:
$\alpha ::=(p)|(\alpha \wedge \alpha )|(\neg \alpha )$ , where $p\in \mathcal{L}$. (* $p$是原子命题符号)

(*经过上述三条规则有限步推出的公式即是合取范式,下面的主要内容都以合取范式为研究对象)

Another Form:

1. $s\in WFF$ for each sentence symbol $s$.
2. $\alpha \in WFF\Rightarrow (\neg \alpha )\in WFF$.
3. $\alpha ,\beta \in WFF\Rightarrow (\alpha \wedge \beta )\in WFF$.
4. $WFF$ is the least set among set satifying 1,2 and 3.

这里WFF采用了归纳定义(inductive definition) 的方式，因此后续诸多证明大都采用归纳证明的思路，最常见的是基于sentence的结构进行归纳证明。
According to the definition style(inductive definition) of WFF, most of proof processes below are based on the inductive proof. e.g. based on the structure of the WFF, based on the length of a sentence or (based on the depth of a proof tree when we learn bisimulation.)

Def Model

By a model $A$ for $L$, we mean a subet $A$ of $L$.
(*在命题逻辑语言中，模型就是语言的一个子集)

Def $A\models \alpha$ is defined as follows:

1. $A\models s$ iff $s\in \mathcal{L}$
2. $A\models \alpha \wedge \beta$ iff $A\models \alpha$ and $A\models \beta$
3. $A\models \neg \alpha$ iff it doesn’t hold that $A\models \alpha$. (notation $A⊭\alpha$)

*A |= $\alpha$ means: “a sentece $alpha$ is true in a model A” (or "$\alpha$ holds in A" or "A is a model of $\alpha$")
Note that: There are different:
$A$ is a model of $L$ ($A\subseteq L$)
$A$ is a model of $\alpha$ ($A\models \alpha$)

Def Valid sentence

A sentence $\alpha$ is called valid, in symbol $\models \alpha$, iff $\alpha$ holds in all models for $L$. i.e. $A\models \alpha$ for all $A$.
(*永真式,即对所有模型都被满足的语句, 永真式处于语义范畴)

Def Tautology

(*重言式 $⊢\alpha$,对所有指派都为真的语句, 重言式处于语法范畴)

Def assignment

Let $\alpha$ be a sentence such that all the sentece symbols which occur in $\alpha$ are among the n+1 symbols $s_0,s_1,\dots ,s_n$. (notation: $\alpha (s_0,s_1,\dots ,s_n)$); Let $a_0,a_1,\dots ,a_n$ be a sequence made up of the two letters: $t$ or $f$, we call such a sequence an assginment of $\alpha$, in symbol $V_{a_0,a_1,\dots ,a_n}\alpha (s_0,s_1,\dots ,s_n)$ or $V_{a_0,a_1,\dots ,a_n}\alpha$, or $V_{\overrightarrow{a}}\alpha$
(*指派的意思就是给语句中出现的所有符号赋一个值$true$或者$false$)
Note that: 我们常常使用$\alpha$代替$\alpha (s_0,s_1,\dots ,s_n)$.

Def The value of $\alpha$ for the assignment $a_0,a_1,\dots ,a_n$ is defined, resursively as follows:

1. $\alpha \equiv a_i(0$