definitions Flashcards

1
Q

a divides b

A

there is a natural number k such that b = ak

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

a natural number p is prime if…

A

p is greater than 1 and the only numbers that divide p are 1 and p

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

a natural number that is COMPOSITE is…

A

neither 1 nor prime

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

For f(a) = b, the image is…

A

b

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

For f(a) = b, the pre-image is…

A

a

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

a proposition is

A

a sentence that has exactly one truth value, either T or F

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

the negation of a proposition P

A

is the proposition “not P”, which is true when P is false

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

given propositions P and Q, the conjunction of P and Q is true when…

A

both P and Q are true

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

given propositions P and Q, the disjunction of and Q is true when…

A

exactly at least one of P or Q is true

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

a tautology is…

A

a propositional form that is true for every assignment of truth values to its components
(ex. P∨~P)

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

a contradiction is…

A

a propositional form that is false for every assignment of truth values to its components
(ex. P∧~P)

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

two propositional forms are equivalent if…

A

they have the same truth tables

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

a denial of any proposition P is

A

any proposition equivalent to ~P (ex. ~~~P)

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

the conditional sentence, “if P, then Q” is true if…

A

P is false or Q is true

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

the conditional sentence, “if P then Q” is false if…

A

P is true and Q is false

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

the converse of P⇒Q is

A

Q⇒P

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

the contrapositive of P⇒Q

A

~Q ⇒ ~P

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

T or F: a statement and its converse are always equivalent

A

F

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

T or F: a statement and its contrapositive are equivalent

A

T

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

for propositions P and Q, the biconditional statement is…

A

the statement “P if and only if Q”

21
Q

a biconditional sentence is true when

A

P and Q have the same truth values

22
Q

open sentence

A

a sentence that contains variables, becomes a proposition when its variables are assigned specific values

23
Q

truth set

A

the collection of objects that may be substituted to make an open sentence a true proposition

24
Q

universe of discourse

A

the collection of objects that are available for consideration, often number systems ℂ, ℕ, ℚ, ℝ, ℤ

25
Q

two open sentences are equivalent when…

A

they have the same truth set

26
Q

T or F: the sentence (∃x)P(x) is always true

A

F, only true if P(x) is nonempty

27
Q

T or F: (∀x)P(x) is always true

A

F, only true if the truth set of P(x) is the entire universe

28
Q

two quantified statement are equivalent in a given universe if

A

they have the same truth value in that universe

29
Q

two quantified statements are equivalent if

A

they are equivalent in every universe

30
Q

(∃!x) P(x) is true when

A

the truth set of P(x) has exactly one element

31
Q

theorem

A

a statement that describes a pattern or relationship among quantities or structures

32
Q

a proof of a theorem is

A

a justification of the truth of the theorem that follows the principles of logic

33
Q

axioms (or postulates)

A

a set of statement that are assumed to be true

34
Q

in any proof at any time you may…

A

state an axiom, an assumption, or a previously proven result;
use the tautology rule;
use the replacement rule;
use a definition to state an equivalent to a statement earlier in the proof;
modus ponens rule

35
Q

tautology rule

A

can state a sentence whose symbolic translation is a tautology

36
Q

replacement rule

A

state a sentence equivalent to any statement earlier in the proof

37
Q

lemma

A

a result that serves as a preliminary step, “stepping stone” to final result

38
Q

modus ponens rule

A

after statements P and P⇒Q appear, state Q

39
Q

direct proof of P⇒Q

A

assume P… therefore Q
Thus, P⇒Q

40
Q

proof of P⇒Q by contrapositive

A

assume ~Q…
therefore ~P
thus ~Q⇒~P
therefore P⇒Q

41
Q

when would you use proof by CP?

A

statements of either p and Q is negation or the connection berween denials is easier to understand

42
Q

proof of P by contradiction

A

suppose ~P…
therefore Q…
therefore ~Q.
hence Q∧~Q is a contradiction
thus P

43
Q

when might you use to do a proof by contradiction?

A

to prove any proposition P since direct proofs and proofs by CP can only be used for conditionals, proof by contradiction can also be use for conditionals

44
Q

direct proof of (∀x) P(x)

A

let x be an arbitrary object in the universe…
hence P(x) is true.
therefore, (∀x) P(x) is true

45
Q

proof of (∀x) P(x) by contradiction

A

suppose ~(∀x) P(x)
then (∃x)~P(x)
let t be an object such that ~P(t)…
therefore Q∧~Q which is a contradiction
thus (∃x)~P(x) is false so (∀x) P(x) is true

46
Q

constructive proof of (∃x)P(x)

A

specify one particular object a
if necessary verify that a is in the universe…
therefore, P(a) is true.
thus, (∃x)P(x)

47
Q

indirect proof of (∃x)P(x)

A

… therefore there must be an object a such that P(a) is true.
therefore (∃x)P(x) is true

48
Q

proof of (∃x)P(x) by contradiction

A

suppose ~(∃x)P(x)
then (∀x) ~P(x)…
therefore ~Q∧Q which is a contrdiction
thus ~(∃x)P(x) is false
therefore, (∃x)P(x) is true