LPL 6.1-6.3 lecture

# LPL 6.1-6.3 lecture - Formal Proofs and Boolean Logic...

This preview shows pages 1–3. Sign up to view the full content.

Formal Proofs and Boolean Logic Conjunction rules: Conjunction Elimination ( Elim): P 1 P i P n : P i For any conjunction, Elim may be used to introduce a line that contains any of the conjuncts from that conjunction. 8. Cube(a) Tet(b) Dodec(c) : 12. Cube(a) Elim: 8 13. Dodec(c) 14. Tet(b) Elim: 8 Elim: 8 Conjunction Introduction ( Intro): P 1 : P n : : P 1 P n From any lines that appear in the proof, Intro may be used to build a conjunction with those lines as its conjuncts. The only restriction on this rule is that the lines used must occur before the conjuction that uses those lines. 4. Cube(a) : 7. Dodec(c) : 10. Cube(a) Dodec(c) Intro: 4, 7 Exercises: You try it (pp. 143-147) – Proof Conjunction 1 Proof Conjunction 4

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Disjunction rules: Disjunction Introduction ( Intro): P i : P 1 P i P n For any line in the proof, a disjunction may be formed using that line as a disjunct and
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/10/2011 for the course PHIL 110 taught by Professor ? during the Spring '06 term at South Carolina.

### Page1 / 5

LPL 6.1-6.3 lecture - Formal Proofs and Boolean Logic...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online