LOGIC Flashcards

1
Q

What is the purpose of logic?

A

Purpose of logic is to deduce the validity of a statement from a set of premises.

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

What is propositional logic?

A

Statements can only be either true or false
e.g. “I have a pen” you can either have a pen or not

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

What is compound propositional logic?

A

Use of logical connectives to join different atomic propositions.
e.g. “we’re in paris” or “we’re in Berlin”
“we’re not in paris” (negation)

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

How can we denote different propositions?

A

Using single letters
e.g. F is “Today is Friday” and H is “I’m happy” then
not F is “Today is not friday”

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

What is negation?

A

¬ (not)
- 2 outcomes

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

Using negation, how to calculate when “I am not cold” equate to true?

A
  1. P = “I am cold”
  2. Check whether P is true
  3. Use truth table for negation
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is conjunction?

A


(and)

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

Using conjunction, how to show “It is snowing and I am cold”?

A
  1. Set atomic propositions as letters P = It is snowing Q = I am cold
  2. Individually check P and Q
  3. Truth table for conjunction
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is disjunction?

A


(or)
.. same question solve as add

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

What is implication?

A


(implies)
(if …… then ……)

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

How does implication truth table work?

A

For propositions P and L, P implies L if;
- If P = true, assumption is not held so it does not matter what conclusion is. So proves P ⇒ L
- if L = true , conclusion is already met, no matter what the assumption. So proves P ⇒ L
- if P = true and L = false. the assumption is held but the conclusion is not so P ⇒ L is false.

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

What is double implication?

A


(iff - if and only if)

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

How does double implication work?

A

P ⇔ Q can be written as:
P ⇒ Q ∧ Q ⇒ P or
If P then Q AND if Q then P
case 1: both True =
if P = T and Q = T then P ⇒ Q = T
if Q = T and P = T then Q ⇒ P = T
T ^ T = T
case 2/3: T and F (both ways) =
if P = T and Q = F then P ⇒ Q = F (based on implication truth table
if Q = F and P = T then Q ⇒ P = T
(based on implication truth table
F ^ T = F
case 4: both F =
if P = F and Q = F then P ⇒ Q = T
if Q = F and P = F then Q ⇒ P = T
T ^ T = T

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

What is the purpose of the precedence hierarchy?

A

Brackets are used to resolve any ambiguity in arguments. Hierarchy helps reduce number of brackets.
e.g. P ^ Q v R = (P ^ Q) v R
P ⇔ Q ⇒ R is ambiguous (meaning can change depending on brackets)

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

What is the precedence hierarchy?

A

Tight bind: NOT
AND
OR
Loose bind: IMPLIES, IFF

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

What is logical equivalence?

A

P1 is logically equivalent to P2 iff they have identical truth values under all possible assignments of truth values.
This allows substitution.

17
Q

What is commutativity?

A

P v Q ⇔ Q v P
P ^ Q ⇔ Q ^ P

18
Q

What is associability?

A

(P v Q) v R ⇔ P v (Q v R)
(P ^ Q) ^ R ⇔ P ^ (Q ^ R)

19
Q

What is distributivity?

A

P ^ (Q v R) ⇔ (P ^ Q) v (P ^ R)
P v (Q ^ R) ⇔ (P v Q) ^ (P v R)

20
Q

What is double negation?

A

¬(¬P) ⇔ P

21
Q

What is idempotence?

A

P ^ P ⇔ P
P v P ⇔ P

22
Q

What is de morgan law?

A

¬(P ^ Q) ⇔ ¬P v ¬Q
¬(P v Q) ⇔ ¬P ^ ¬Q

23
Q

What are the 2 propositional constants?

A

true and false
true is always T
false is always F

24
Q

What is a tautology?

A

Proposition that is true for ALL possible combinations
e.g. P v ¬P and (P v ¬Q) v (¬P ^ Q)

25
Q

what is a contradiction?

A

Proposition that is false for ALL possible combinations
e.g. false and P ^ ¬P

26
Q

What is a Valid argument?

A

A valid argument is an argument which has a valid conclusion where both premises are valid.

27
Q

What is an argument, premise and conclusion?

A

ARGUMENT = collection of propositions
PREMISES = all other propositions to meet conclusion. Last column of truth table
CONCLUSION= proposition justified by the premises

28
Q

How to check for a valid argument?

A

For every instance of each atomic proposition, a premise is found to be T or F.
If both premises are T, consider the conclusion.
Valid argument if final conclusion is also T
Invalid argument if final conclusion is F

29
Q
A