Propositional Logic Flashcards

1
Q

T ^ T =
T ^ F =
F ^ T =
F ^ F =

A

T
F
F
F

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

Logical equivalency

A

Two propositions, say P and Q, are logically equivalent if P ⟺ Q is a TAUTOLOGY. In this case, the biconditional of P and Q (i.e. P ⟺ Q) is called a logical equivalency.

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

What is the no. of rows in a truth table for 3 propositions?

A

2^3 = 8

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

Premise

A

Proposition (atomic/compound) to the left of the implication operator. Also called antecedent or hypothesis.

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

Exclusive-Or

A

A compound proposition where ONLY the “XOR” operator is applied on 2 or more propositions.

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

Commutative properties (logical equivalencies)

A

P v Q ⟺ Q v P
P ^ Q ⟺ Q ^ P

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

Implication Law

A

(P ⇒ Q) ⟺ (¬P v Q)

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

Consequence

A

Proposition (atomic/compound) to the right of the implication operator. Also called conclusion.

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

Contingency

A

A compound proposition (statement) that is NEITHER a TAUTOLOGY NOR a CONTRADICTION.

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

Which words does conjunction (^) denote?

A

“and”, “but”, “also”, “as well as”

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

How is an implication of 2 statements/propositions, say P and Q written in English, where P ⇒ Q?

A

“if P then Q”
“If P, Q”
“P implies Q”
“Whenever P, Q”
“P is sufficient for Q”
“Q is necessary for P”
“Not P unless Q”
“P only if Q”
“Q if P”
“Q whenever P”

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

T ⇒ T
T ⇒ F
F ⇒ T
F ⇒ F

A

T
F
T
T

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

What is the no. of rows in a truth table for an n no. of propositions?

A

2^n

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

Negation operator

A

¬ or ~

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

Biconditional of P and Q

A

A compound proposition which is TRUE precisely when either P and Q are BOTH TRUE, or when P and Q are BOTH FALSE.

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

Implication

A

A compound proposition where ONLY the “IMPLIES/IF-THEN” (conditional) operator is applied on 2 propositions.

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

Conjunction

A

A compound proposition where ONLY the “AND” operator is applied on 2 or more propositions.

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

Biconditional symbol

A

↔ or ⟺

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

Conjunction symbol

A

(^)

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

Conclusion

A

Proposition (atomic/compound) to the right of the implication operator. Also called consequence.

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

Difference between disjunction/OR/v and or-exclusive/XOR/⊕ ?

A

In a disjunction of 2 statements, the truth value is “true” if both statements are true, but an exclusive-or of 2 statements is false if both statements are true.

22
Q

truth value

A

The value of a proposition; it can be either “true” or “false”

23
Q

Logical equivalency between Implication and Contrapositive

A

(P ⇒ Q) ⟺ (¬Q ⇒ ¬P)

24
Q

T ⊕ T =
T ⊕ F =
F ⊕ T =
F ⊕ F =

A

F
T
T
F

25
Q

DeMorgan’s Laws (logical equivalencies)

A

¬(P ^ Q) ⟺ ¬P v ¬Q
¬(P v Q) ⟺ ¬P ^ ¬Q

26
Q

Tautology

A

A compound proposition (statement) that is ALWAYS TRUE IRRESPECTIVE of the TRUTH VALUES of the propositions in it.

27
Q

compound proposition

A

A proposition that is a combination of two or more propositions through logical operators such as “and”, “or”, “not”, etc.

28
Q

Order of operations (highest to lowest precedence)

A

Negation, Conjunction, Disjunction, Exclusive-or, Implication, Biconditional

29
Q

Disjunction symbol

A

V

30
Q

Associative properties (logical equivalencies)

A

(P v Q) v R ⟺ P v (Q v R)
(P ^ Q) ^ R ⟺ P ^ (Q ^ R)

31
Q

What is the no. of rows in a truth table for 4 propositions?

A

2^4 = 16

32
Q

proposition

A

A statement that can only be either true or false.

33
Q

~T –>
~F –>

A

F
T

34
Q

T v T =
T v F =
F v T =
F v F =

A

T
T
T
F

35
Q

Converse of P ⇒ Q

A

Q ⇒ P

36
Q

How is a biconditional of 2 statements/propositions, say P and Q written in English?

A

“P if and only if Q”, “Q if and only if P”, “P iff Q”, “Q iff P”, “P is necessary and sufficient for Q”, “Q is necessary and sufficient for P”, “if P then Q, and conversely”, “if Q then P, and conversely”.

37
Q

Truth Table

A

A table that displays the possible values for a proposition or propositions as well as the results which followed when operators are applied.

38
Q

Inverse of P ⇒ Q

A

¬P ⇒ ¬Q

39
Q

Implication symbol

A

⇒ or →

40
Q

Contrapositive of P ⇒ Q

A

¬Q ⇒ ¬P

41
Q

How is a biconditional of 2 statements/propositions, say P and Q written in English?

A

“P if and only if Q”, “Q if and only if P”, “P iff Q”, “Q iff P”, “P is necessary and sufficient for Q”, “Q is necessary and sufficient for P”, “if P then Q, and conversely”, “if Q then P, and conversely”.

42
Q

Exclusive-Or symbol

A

43
Q

Antecedent

A

Proposition (atomic/compound) to the left of the implication operator. Also called premise or hypothesis.

44
Q

Hypothesis

A

Proposition (atomic/compound) to the left of the implication operator. Also called premise or antecedent.

45
Q

Distributive properties (logical equivalencies)

A

P v (Q ^ R) ⟺ (P v Q) ^ (P v R)
P ^ (Q v R) ⟺ (P ^ Q) v (P ^ R)

46
Q

Double negation property (a logical equivalency)

A

¬ (¬ P) ⟺ P is a tautology.

47
Q

Contradiction

A

A compound proposition (statement) that is ALWAYS FALSE IRRESPECTIVE of the TRUTH VALUES of the propositions in it.

48
Q

Logical equivalency between Inverse and Converse

A

(Q ⇒ P) ⟺ (¬P ⇒ ¬Q)

49
Q

T ⟺ T
T ⟺ F
F ⟺ T
F ⟺ F

A

T
F
F
T

50
Q

Disjunction

A

A compound proposition where ONLY the “OR” operator is applied on 2 or more propositions.