MATH 1190 Lecture Notes - Lecture 5: First-Order Logic, Propositional Calculus, Propositional Function
1 Feb 2018
School
Department
Course
Professor
Document Summary
Math 1190 lecture 5 notes- predicates and quantifiers. Similarly, because cs2 and math1 are on the list of computers under attack, we know that a(cs2) and a(math1) are true: we can also have statements that involve more than one variable. For instance, consider the statement x = y + 3. : we can denote this statement by q(x, y), where x and y are variables and. In general, a statement involving the n variables x1, x2, . , xn can be denoted by p(x1, x2, . , xn): a statement of the form p(x1, x2, . , xn) is the value of the propositional function p at the n-tuple (x1, x2, . If p(x) is true for this value of x, the assignment statement x := x + 1 is executed, so the value of x is increased by 1.
