Infinite- Models-for- Propositional- Calculi课件.pptVIP

The Proof Ix IIx IIIx … IIIIIIx III…Ix … Suppose M “thinks” that IIx = IIIIIIx. * 。 The Proof Ix IIx IIIx … IIIIIIx III…Ix … Suppose M “thinks” that IIx = IIIIIIx. Then according to M: CIIIIIIxIIx = Cxx, which is a theorem. * 。 The Proof According to M: CIIIIIIxIIx = Cxx, which is a theorem. Now consider: CCIIIIIIxIIxy=CCIIII(IIx)(IIx)y, which is of the form: CCIII…IXXY, which is a theorem (where X=IIx). * 。 The Proof According to M: CIIIIIIxIIx = Cxx, which is a theorem. Now consider: CCIIIIIIxIIxy=CCIIII(IIx)(IIx)y, which is of the form: CCIII…IXXY, which is a theorem (where X=IIx). So one application of modus ponens yields y. Therefore, the model must validate everything. * 。 What Happened? Finite matrix models must “identify” two elements of any sufficiently long list of formulae. So it will incorrectly think that when those formulae are combined, the resulting formula will be equivalent to Cxx. No finite matrix model validates exactly the instances of Cxx (G?del). If Cxx is a theorem, then the model will validate the formula. * 。 How to Use a Matrix Model 1 2 1 1 1 2 1 2 CpCqq p q q * 。 How to Use a Matrix Model 1 2 1 1 1 2 1 2 CpCqq p q q 1 2 2 1 1 * 。 Finite Matrices as Finite Automata Using a finite matrix model is like letting an automaton run over a tree. “Designated Values” are like “Accept States”. CpCqq p q q 1 2 2 1 1 * 。 The Disanalogy -- Vocabulary Finite tree automata have a finite input language. Logics have an infinite language with countably many variables. This matters for models, but not for countermodels. * 。 Restricting the Input Vocabulary Suppose {Cpq, r}?s, by condensed detachment, and suppose s has fewer distinct variables than one of the premises. Then there is a substitution ? such that: ?p= ?r; ?q=s, and ?Cpq and ?r have no variables not appearing in s. Therefore, if P is a set of premises, and there is a proof of C from P, then there is a proof of C from P containing only variables occurring in C. * 。 * . . * . . * . . * . . * . .