CISC 102 Lecture Notes - Lecture 37: Propositional Function, Universal Quantification, Complex Instruction Set Computing

86 views3 pages
Verified Note

Document Summary

P(x): x + 2 > 7; tp = {x : x > 5} P(x): x + 5 < 3; tp = . P(x): x + 5 > 1; tp = . A quantified proposition using the propositional function can be stated as: ( x a) p(x) (for all x in a p(x) is true) Tp = {x : x a, p(x)} = a. P(x1) p(x2) p(x3) is true. A quantified proposition using the propositional function can be stated as: ( x a) p(x) (there exists an x in a s. t. Tp = {x : x a, p(x)} . P(x) is true for every x a. P(x) is false for one or more x . P(x) is true for one or more x a. p(x) is false for every x a. Let p(x,y) be the proposition that x+y=10 where the ordered pair (x,y) {1,2, ,9} {1,2, 9}. Statement 1 is true, statement 2 is false by inspection.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions