人工智能chapter3章节.pptVIP

Proving procedure Enumerate conclusions from a set of premises ?: If ? appears, ? is provable from ? and so is a logical consequence of ?; If ?? appears, ?? is a logical consequence of ?, ? is not logical implied by ?. Decidable: either a sentence or its negation can be got from a set of sentences Semidecidable: neither a sentence nor its negation are logical implied by ?. Finitely axiomatizable A theory is finitely axiomatizable if and only if there is a finite database ? that generate all the members of by logical implication; that is, If a theory is finitely axiomatizable, then it is semidecidable. If a theory is finitely axiomatizable and complete, then it is decidable. §3.5 Proving Provability Reduce the provability of one sentence to the provability of another sentence. Proof： n is the length of the proof for ?. Induce on n. n=1: if ? is identical to ?, then ???; n=1: if ? is a logical axiom or a member of ?, then we can get ??? from ? and (? ?(? ? ?)) (II) by MP. n=k-1: Suppose the proposition holds on. n=k: By MP (assumption) By induction hypotheses ID (? ? ?) ? (? ? ?) MP ? ? ? n steps of Deduction Theorem n steps of MP Deduction Theorem MP Rule T By definition Deduction Theorem Rule T CR: ? is inconsistent if and only if there is Proof：Suppose n is the length of the proof for ?. Induce on n. n=1: if ? is a member of ?, then ? is not free in ?, using UG, we have n=1: if ? is a logical axiom, then is also a logical axiom. n=k-1: Suppose the proposition holds on. n=k: By MP (assumption) By induction hypotheses