Quiz 1 Flashcards
How do you define an empty set?
{ } or Ø
Define a “Conjunction” compound statement and its symbol.
A conjunction compound statement means if any statement is False, the whole thing is false. It is denoted by a big “^” symbol or the word “and”.
Ex:
P = True
Q = False
P ^ Q = False
Define a “Biconditional” statement and its symbol.
A biconditional statement is only True if both statements are the equal. It is denoted by the symbol “<–>” or the format “if and only if”.
Ex:
P = False
Q = False
P <–> Q = True
What is the set of Integers?
The set of Integers is all whole numbers that are positive, negative, or zero.
Ex:
{…-3, -2, -1, 0, 1, 2, 3,…}
Use Inductive Reasoning to predict the next number:
5, 11, 17, 23, 29, __
35.
What is the set of negative integers between -5 and +6?
{-4, -3, -2, -1}
Which type of compound statement is:
If 5 > 3, then 2 + 7 = 4
Is it True or False?
It is a conditional statement (if…, then…), and it is False.
How many exams (not including final) will be given?
3.
Which type of compound statement is:
4 <= 9
Is it True or False?
It is a disjunction (or), and it is True.
What compound statement’s symbol is “^”?
A conjunction.
What is the negation of the quantifiers:
All ____ are ____.
The negation of the quantifiers are “some” and “are not”.
Define a “Conditional” statement and its symbol.
A conditional statement follows the conclusion’s result*. It is denoted by the “—>” symbol or the format “If…, (then)…” (Hypothesis —> Conclusion).
* Besides (F —> F), which is True.
Ex:
P = True
Q = False
P —> Q = Conclusion (Q) = False
How many rows are in a Truth Table with 4 variables?
24 = 16 rows
What is the complement of the Universe, U?
U′ = Ø (empty set)
What are the quantifiers in the statement:
All dogs are friendly.
What is the statement’s negation?
The quantifiers are the words “all” and “are”. The negation of the statement is “Some dogs are not friendly”.
What compound statement’s symbol is “v”?
A disjunction.
Define “Inductive Reasoning”.
It is the process of reaching a general conclusion by examining specific examples. (pattern, specific -> general)
What is the negation of the quantifiers:
No(ne) ____.
The negation of the quantifier is “some”.
What is a counterexample?
If you can find one case for which statement is not true, then it is called a counterexample.
Ex:
x + x > x. FALSE
c.e.: x=0, 0+0 is not greater than 0.
How many rows are in a Truth Table with 3 variables?
23 = 8 rows
What is the set of counting numbers larger than 11 and less than or equal to 19?
{12, 13, 14, 15, 16, 17, 18, 19}
Define “Deductive Reasoning”.
It is the process of reaching a conclusion by applying general assumptions, procedures, or principles. (general –> specific)
A = {1, 2, 3, 4, 5} ; B = {2, 3, 4, 5}
Is A⊆B true or false?
False.
Define a “Subset”. How is it denoted?
A is a subset of B, if and only if every element of A is also an element of B. It is denoted by the symbol “⊆”.
Ex:
A = {2, 3, 4} ; B = {2, 3, 4, 5}
A⊆B = True