Math as a language Flashcards

1
Q

When is a disjunction false?

A

False only when both propositions are false

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

Process of making general conclusion based on specific examples

A

Inductive reasoning

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

When is a conditional proposition false?

A

When hypothesis is true and conclusion is false

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

Converse

A

p => q is q => p
Swap only, no negate

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

Process of making specific conclusion based on general principles

A

Deductive reasoning

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

Inverse and logically equiv

A

Inverse is not logically equiv

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

Ability of a person to analyze problem situations and construct logical arguments to create both conceptual foundations and connections to be able to process the available info and solve the prob

A

reasoning

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

Systematic means of communicating by the use of sounds/conventional symbols

A

Language

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

Inverse

A

p => q is -p => -q
negate only, no swap

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

Biconditional propositions

A

p <=> q is also equal to (p => q) ^ (q => p)

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

A statement that can be shown to be T

A

Theorem

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

When is a conjunction true?

A

True only when both propositions are true

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

Morgan’s Law

A

The value of - (p v - q) is the same as -p ^ q

Distribute the negation, invert the v or ^

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

Contrapositive

A

p => q is -q => -p
Negate and swap

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

If p and q are propositions, new (____) propositions can be formed using _____

A

Compound, connectives

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

Double implication

A

Biconditional proposition (p if and only if q)

17
Q

If p then q

A

Conditional proposition | p = premise/hypothesis, q = consequent / conclusion

18
Q

Contrapositive and logically equiv?

A

Contrapositive is logically equivalent. That’s y U can prove either implication or it’s Contrapositive

19
Q

Biconditional and logically equiv

A

2 propositions r and s are logically equiv if r <=> s is always T

20
Q

p v -p is always true

A

True

21
Q

^ = ? v = ?

A

^ = and (conjunction)
v = or (disjunction)

22
Q

A compound proposition that is always T

A

Tautology

23
Q

2 Propositions are said to be logically equivalent if?

A

If both T tables are identical

24
Q

To show that a theorem is T, we construct a sequence of statements that form an argument called ___

A

Proof

25
Q

Declarative sentences that’s either T/F but not both

A

Proposition/statements

26
Q

A compound proposition that is always F

A

Contradiction

27
Q

Examples of contingency

A

Inverse, converse, Biconditional

28
Q

Neither a tautology nor a contradiction

A

Contingency (mix of T and F)

29
Q

Formula for the combination of truth table

A

2 ^ n, n = # of propositions

30
Q

Converse and logically equiv

A

Converse is not logically equiv