Exam 2 Flashcards
A sentence that contains a finite number of variables and becomes a statement when specific values are substituted for the variables
Predicate
The set of all values that may be substituted in place of the variable
Domain
Ex:
{x £ D | P(x)}
Truth set
Symbol inside down A denotes “for all” and is called:
Universal quantifier
A statement of the form “upsidedown Ax £ D, Q(x)”. Defined true if, and only if, Q(x) is true for every x in D.
Universal statement
A value for x for which Q(x) is false is called a _____________ to the universal statement
Counterexample
The technique used to show the truth of the universal statement:
1^2 >= 1, 2^2 >= 2, 3^2 >= 3, 4^2 >= 4
Hence “upside down x £ D, x^2 >= x” is true.
This is called:
method of exhaustion
Consists of showing the truth of the predicate separately for each individual element of the domain.
Method of exhaustion
The symbol E denotes “there exists” and is called the:
Existential quantifier
Is a statement of the form “Ex £ D such that Q(x).” It is defined as true if, and only if, Q(x) is true for at least one x in D.
Existential statement
A reasonable argument can be made that the most important form of statement in mathematics is:
Universal conditional statement
The negation of a universal statement (“all are”) is logically equivalent to an:
Existential statement
Note that’s when we speak of __________________, we mean that the statements always have identical truth values no matter what predicates are substituted for the predicate symbols and no matter what sets are used for the domains of the predicate variables.
Logical equivalence for quantified statements
~(upside down Ax, if P(x) then Q(x)) is logically equivalent Ex such that P(x) and ~Q(x)
Negation of a universal conditional statement
The ____________ of a real number a is a real number b such that ab=1.
Reciprocal