(数理逻辑与软件工程)MLChapter02PredicateLogic.ppt

Definition 2.17 A look-up table or environment for a universe A of concrete value is a function l : var → A, from the set of variables var to A. Definition 2.18 Given a model M for a pair (F, P) and given an environment we define the satisfaction relation M ╞ l Φ for each logical formula Φ over thr pair (F, P) and look-up table by structural Induction on Φ . P: If Φ is the form P(t1, t2,…, tn), then we interpret the terms t1, t2,…, tn in our set A by replacing all variables with their values according l . In this way we computer concrete values a1, a2,…, an of A , we interpret any function symbol f ∈ F by f M of A. Now M ╞ l P(t1, t2,…, tn) holds iff ( a1, a2,…, an) is in the set of PM . ?x The relation M ╞ l ?x Ψ holds iff M ╞ l [x → a] Ψ for all a ∈A. ?x The relation M ╞ l ?x Ψ holds iff M ╞ l [x → a] Ψ for some a ∈A. ﹁: The relation M ╞ l ﹁Ψ holds iff it not the case that M ╞ l Ψ . ∧: The relation M ╞ l Ψ1 ∧ Ψ2 holds iff M ╞ l Ψ1 and M ╞ l Ψ2 . ∨: The relation M ╞ l Ψ1 ∨ Ψ2 holds iff M ╞ l Ψ1 or M ╞ l Ψ2 . →: The relation M ╞ l Ψ1 → Ψ2 holds iff M ╞ l Ψ 2holds whenever M ╞ l Ψ1 . Example2.19 Φ= ?x ?y (loves(x,alma) ∧ loves(y,x) → ? loves(y,alma)), Model M is as follow: A={a, b, c} almaM=a, {lovesM={ (a,a), (b,a), (c, a) } The evaluation under the Model M: Φ=F Definition 2.20 (Semantic entailment, satisfiable, valid) Let Γ be a set of formulas and Ψ a formula in predicate logic 1. Semantic entailment Γ╞ Ψ holds iff for all model M and look-up table l whenever M ╞ l Φ holds for all Φ ∈ Γ, then M ╞ l Ψ holds as well. 2. Formula Ψ is satisfiable iff there is some model M and some environment l such that M ╞ l Ψ holds. 3. Formula Ψ is valid iff M ╞ l Ψ for all models M and environment l in which we can check Ψ. 4. The set Γ╞ Ψ is consistent or satisfiable iff there is a model M and look-up table l whenever M ╞ l Φ h