Logic And Proof Techniques Flashcards

1
Q

Define a statement
Aka…

A

A statement is a sentence that is either true or false but not both
Aka proposition

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

What is a logical connective?

A

Logical connectives are used to combine simple statements into complex ones

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

What is useful about or in mathematics?

A

It is inclusive so if P and Q are true
then P or Q is true

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

Define conjunction

A

A statement that is true if both P and Q are true; otherwise it is false

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

Define disjunction

A

A statement that is true if either one of P or Q is correct or both; otherwise it is false

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

What is a truth table?

A

A table that shows the different possibilities if P and Q… are true or false

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

Define negation

A

This statement is true if P is false and false if P is true

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

Define implication

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

What do you need to remember to make implications make sense?

A

We give the benefit of the doubt. If P is false then the implication is true

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

What is one way to prove that 2 statements are equivalent?

A

Create their truth tables

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

Define equivalence

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

How do you abbreviate if and only if

A

Iff

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

Give a useful implication example

A

The proposition if it rains then i bring an umbrella.
If you see an umbrella it doesn’t mean it isn’t raining

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

How mnay laws of logic are there?

A

7

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

State the first 3 laws of logic

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

State the absorption laws of logic

A
17
Q

State the distributive laws

A
18
Q

State De Morgan’s laws

A
19
Q

State the law of syllogism

A
20
Q

What are the names of the different laws of logic?

A

Commutative
Associative
Idempotent
Absorption
Distributive
De Morgan’s
Law of Syllogism

21
Q

Negate the statement P implies Q

A
22
Q

What is a predicate

A

A predicate is a softer statement, usually when we haven’t defined what x is

23
Q

What do you need to be careful about quantifiers
+++

A

The order really matters (Proof of infinity example)

This is less important when the quantifiers are the same

24
Q

How can we prove a statement which gives x as being part of the finite set X?

A

Try all values or use an arbitrary value x and prove it

25
Q

How do you want to disprove the statement that looks like this:

A

Counterexample

26
Q

How do you prove a statement in the form of this:

A

Give 1 answer which fulfils the equation

27
Q

What is a comon way to prove/ disprove statements?

A

Disprove/prove their negations

28
Q

What do i keep forgetting about he E symbol?

A

It means exists 1
1
So i can choose the value i use in the domain

29
Q

What is te contrapositive

A
30
Q

What is the converse?

A
31
Q

Hat is the point of proof by contradiction?

A

If we can negate our statement and assume is true then we can get some absurd thing such as 1=2 then our assumption must be false

32
Q

What will help me when doing negations?

A

Translate the words into symbols then negate it

33
Q

What can we use contrapositives to our advantage?

A

If we can prove the contrapositive true that means that he original implication is true as implication is equivalent to contrapositive

34
Q

What is a common technique when proving inequalities?

A

Using our brain and saying that this has to be at least less than n etc

35
Q

How is the contrapositive of an implication useful to us?

A

They are the same thing so proof of either is proof of the implication