19 Slides--Logic of Quantifiers

# 19 Slides--Logic of Quantifiers - CS103A Handout#19...

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

CS103A Handout #19 Slides--Logic of Quantifiers 2/1/08 1 CS103A 2/1/08 Midterm Exam Tues., Feb. 12 7 - 9 pm Location: TBA x Cube(x) x Cube(x) ¬ x Cube(x) ¬ x Cube(x) x ¬Cube(x) x ¬Cube(x) Describe a world for each of these x (Professor(x) Smart(x)) x Professor(x) x Smart(x) x (Professor(x) Smart(x)) x Professor(x) x Smart(x) Tautologies with Quantifiers P ¬P ( x Cube(x)) ( x ¬Cube(x)) ( x Cube(x)) x Cube(x)) Truth-Functional Form -- Replace quantified constituents with a letter -- Replace remaining atomic constituents with a letter -- Reuse the same letter for identical constituents -- Maintain connectives outside of quantifiers -- Check the result [ z (Cube(z) Large(z)) Cube(b) ] Large(b) [ ( x Cube(x) → ∀ x Small(x)) ¬ x Small(x) ] ¬ x Cube(x) A way to determine whether a quantified sentence is a tautology. Cube(a)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/01/2011 for the course CS 103A taught by Professor Plummer,r during the Winter '07 term at Stanford.

### Page1 / 2

19 Slides--Logic of Quantifiers - CS103A Handout#19...

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

View Full Document
Ask a homework question - tutors are online