I&C SCI 6B Chapter Notes - Chapter 1.4: Propositional Function, Universal Quantification, Existential Quantification

• School: UC-Irvine
• Department: Information and Computer Science
• Course: I&C SCI 6B
• Professor: Wayne Hayes

Document Summary

Textbook used: discrete mathematics and its applications, rosen, 7th edition. Predicate logic: can be used to express the meaning of a wide range of statements in math and computer science. Predicate: in the statement x is greater than 3 , the subject of the statement is x, and the predicate is the second part, is greater than 3. Propositional function: if we denote x is greater than 3 as p(x),where. P is the predicate and x is the variable, the statement p(x) is said to be the value of the propositional function p at x. When x gets assigned a value, p(x) becomes a proposition and has a truth value. N-place predicate (n-ary predicate): p(x1, x2, xn) is the value of the propositional function p at the n-tuple (x1, x2, xn) Precondition: the statements that describe valid input. Postcondition: the conditions that the output should satisfy when the program has run. Quantification: creating a proposition from a propositional function.