正在加载图片...
We can infer from the example that truth valuation of a propostion is determined by those ions which it is based We define the following term to guarantee the truth of a compound proposition Definition 2(Valuation). A truth valuation v is a function that assigns to each proposi- tion a a unique truth value v(a) so that its value on a compound proposition is determined in accordance with the appropriate truth tables Here, we should remember that truth valuation determines all propositions generated ac- cording to definition of well-defined proposition. Especially, when a is a propositional letter we have V(a)=A(a) for some.A Generally, we have the following theorem Theorem 3. Given a n assignment a there is a unique truth valuation v such that V(a)=A(a)for every sitional letter a Proof. The proof can be divided into two step 1. Construct a from A by induction on the depth of the associated formation tree 2. Prove the uniqueness of v with the same A by induction bottom-up It shows us the relation between truth assignment and truth valuation. Actually, truth assignment and valuation characterize the semantics of proposition logic from different views For simplicity of theory, one is enough. For convenience, both are needed to make statement Specially, we just consider a specific proposition a. Then there are only finite propositional letters taken into consideration. There is a corollary Corollary 4. If Vi and v2 are two valuations that agree on the support of a, the finite set of propositional letters used in the construction of the proposition of the proposition a, then n(a)=2(a Two valuation are different. But when the assignments determined agree with each other on support. They have the same truth value on a proposition Given a proposition, there is a case that it is always true whatever the truth valuation is Definition 5. A proposition o of propositional logic is said to be valid if for any valuation V,V(o)=T. Such a proposition is also called a tautology Example 2. aVna is a tautologyWe can infer from the example that truth valuation of a propostion is determined by those propositions which it is based on. We define the following term to guarantee the truth of a compound proposition. Definition 2 (Valuation). A truth valuation V is a function that assigns to each proposi￾tion α a unique truth value V(α) so that its value on a compound proposition is determined in accordance with the appropriate truth tables. Here, we should remember that truth valuation determines all propositions generated ac￾cording to definition of well-defined proposition. Especially, when α is a propositional letter we have V(α) = A(α) for some A. Generally, we have the following theorem: Theorem 3. Given a truth assignment A there is a unique truth valuation V such that V(α) = A(α) for every propositional letter α. Proof. The proof can be divided into two step. 1. Construct a V from A by induction on the depth of the associated formation tree. 2. Prove the uniqueness of V with the same A by induction bottom-up. It shows us the relation between truth assignment and truth valuation. Actually, truth assignment and valuation characterize the semantics of proposition logic from different views. For simplicity of theory, one is enough. For convenience, both are needed to make statement simple. Specially, we just consider a specific proposition α. Then there are only finite propositional letters taken into consideration. There is a corollary. Corollary 4. If V1 and V2 are two valuations that agree on the support of α, the finite set of propositional letters used in the construction of the proposition of the proposition α, then V1(α) = V2(α). Two valuation are different. But when the assignments determined agree with each other on support. They have the same truth value on a proposition. Given a proposition, there is a case that it is always true whatever the truth valuation is. Definition 5. A proposition σ of propositional logic is said to be valid if for any valuation V, V(σ) = T. Such a proposition is also called a tautology. Example 2. α ∨ ¬α is a tautology. 2
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有