Chapter 1 Flashcards

1
Q

premise

A

the statement(s) preceding the conclusion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

nested quantifier

A

one quantifier is within the scope of another

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

E!xP(x)

A

unique quantification of P(x)

“there exists only one”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

unsatisfiable

A

when the compound proposition is false for all assignments of truth values to its propositional variables (contradiction)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

satisfiable

A

if there is an assignment of truth values to its propositional variables that makes the compound proposition true (tautology or contingency)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

tautology

A

a compound proposition that is always true, no matter what the truth values of its propositional variables are

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

precedence rules

A

existential/ universal, negation, conjunction, disjunction, conditional, biconditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

atomic proposition

A

a proposition that cannot be expressed in terms of simpler propositions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

truth values

A

true or false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

propositional variables

A

variables that represent propositions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

proposition

A

a statement that is either true or false, not both

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

proof by contradiction

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

formal proof

A

all steps are supplied and the rules for each step in the argument is given

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

!p

A

negation of p

the truth value of !p is the opposite of p

“not p”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

p <–> q

A

biconditional statement

true when both p and q have the same truth value and false otherwise

“p if and only if q”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

p XOR q

A

exclusive or

true when only one proposition is true and false otherwise

“p or q, not both”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

p || q

A

disjunction of p and q

false when both p and q are false and true otherwise

“p or q”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

p && q

A

conjunction of p and q

true when both p and q are true and false otherwise

“p and q”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

ExP(x)

A

existential quantification of P(x)

“there exists”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

AxP(x)

A

universal quantification of P(x)

“for all”
“for each”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

p == q

A

logically equivalent

compound propositions that have the same truth values in all cases

(if p <–> q is a tautology)

22
Q

theorem

A

a statement that has been proven to be true

23
Q

lemma

A

a less important theorem that is helpful in the proof of other results

24
Q

definition of an even number

A

the integer n is even if there exists an integer k, such that n = 2k

25
Q

definition of an odd number

A

the integer n is odd if there exists an integer k, such that n = 2k - 1

26
Q

proof by contraposition

A
27
Q

p –> q

A

conditional statement

false when p is true and q is false, and true otherwise

“if p, then q”

p is the hypothesis
q is the conclusion

28
Q

compound proposition

A

the combination of one or more propositions to form new propositions using logical operators

29
Q

contradiction

A

a compound proposition that is always false, regardless of the truth values of its propositional variables

30
Q

solution

A

when a particular assignment of truth values makes the compound proposition true

31
Q

postconditions

A

the statements that the output should satisfy

32
Q

domain of discourse

A

asserts that a property is true for all values of a variable in a particular set of values

33
Q

definition of a rational number

A

the real number r is rational if there exists integers p and q, where q != 0, such that r = p / q

34
Q

counterexample

A

an element for which P(x) is false is a counterexample of AxP(x)

35
Q

informal proof

A

more than one rule of inference may be used in each step, the axioms being assumed and the rules of inference used are not explicitly stated

36
Q

argument form

A

a sequence of compound propositions involving propositional variables

37
Q

clause

A

a disjunction of variables or the negations of these variables

38
Q

contingency

A

a compound proposition that is neither a tautology nor a contradiction

39
Q

q –> p

A

converse of p –> q

false when p is false and q is true

40
Q

!p –> !q

A

inverse of p –> q

false when p is false and q is true

41
Q

!q –> !p

A

contrapositive of p –> q

false when p is true and q is false

42
Q

predicate

A

refers to a property that the subject of the statement can have

P(x), where P denotes the predicate

43
Q

preconditions

A

the statements that describe valid input

44
Q

quantification

A

expresses the extent to which a predicate is true over a range of values

45
Q

argument

A

a sequence of statements that end with a conclusion

46
Q

valid

A

the conclusion must follow from the truth of the preceding statements

47
Q

fallacies

A

common forms of incorrect reasoning that lead to invalid arguments

48
Q

conjecture

A

a statement that is being proposed as true

49
Q

corollary

A

a theorem that can be established directly from a theorem that has been proven

50
Q

axioms

A

also called postulates

statements we assume to be true

51
Q

proof

A

a valid argument that establishes the truth of a theorem