Propositional Logic - Laws, Logical Consequences, and Arguments

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/17

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering the basic and advanced equivalence laws of propositional logic, bi-conditionals, logical consequences, and arguments from Week 2 of MA4001.

18 Terms

1
New cards

Bi-conditional

A compound proposition formed by combining propositions pp and qq in the form "p if and only if q", denoted by p↔qp \leftrightarrow q, which is true whenever both propositions have the same truth values, and false otherwise. It is shorthand for (p→q)∧(q→p)(p \rightarrow q) \land (q \rightarrow p).

2
New cards

Commutative Laws

The basic laws of propositional logic stating that p∨q≡q∨pp \lor q \equiv q \lor p and p∧q≡q∧pp \land q \equiv q \land p.

3
New cards

Associative Laws

The basic laws of propositional logic stating that (p∨q)∨r≡p∨(q∨r)(p \lor q) \lor r \equiv p \lor (q \lor r) and (p∧q)∧r≡p∧(q∧r)(p \land q) \land r \equiv p \land (q \land r).

4
New cards

Distributive Laws

The basic laws of propositional logic stating that p∧(q∨r)≡(p∧q)∨(p∧r)p \land (q \lor r) \equiv (p \land q) \lor (p \land r) and p∨(q∧r)≡(p∨q)∧(p∨r)p \lor (q \land r) \equiv (p \lor q) \land (p \lor r).

5
New cards

Identity Laws

The basic laws of propositional logic stating that p∨FALSE≡pp \lor \text{FALSE} \equiv p and p∧TRUE≡pp \land \text{TRUE} \equiv p.

6
New cards

Complement Laws

The basic laws of propositional logic stating that p∨¬p≡TRUEp \lor \neg p \equiv \text{TRUE} and p∧¬p≡FALSEp \land \neg p \equiv \text{FALSE}.

7
New cards

Negation Laws

The laws of propositional logic stating that ¬FALSE≡TRUE\neg \text{FALSE} \equiv \text{TRUE} and ¬TRUE≡FALSE\neg \text{TRUE} \equiv \text{FALSE}.

8
New cards

Idempotent Laws

The laws of propositional logic stating that p∨p≡pp \lor p \equiv p and p∧p≡pp \land p \equiv p.

9
New cards

Domination Laws

The laws of propositional logic stating that p∨TRUE≡TRUEp \lor \text{TRUE} \equiv \text{TRUE} and p∧FALSE≡FALSEp \land \text{FALSE} \equiv \text{FALSE}.

10
New cards

Absorption Laws

The laws of propositional logic stating that p∨(p∧q)≡pp \lor (p \land q) \equiv p and p∧(p∨q)≡pp \land (p \lor q) \equiv p.

11
New cards

Double Negation Law

The law of propositional logic stating that ¬(¬p)≡p\neg(\neg p) \equiv p.

12
New cards

De Morgan’s Laws

The laws of propositional logic stating that ¬(p∨q)≡¬p∧¬q\neg(p \lor q) \equiv \neg p \land \neg q and ¬(p∧q)≡¬p∨¬q\neg(p \land q) \equiv \neg p \lor \neg q.

13
New cards

Logical Consequence

A relationship between compound propositions where proposition QQ is true whenever all propositions P1,P2,…,PnP_1, P_2, \dots, P_n are true, denoted as P1,P2,…,Pn⊢QP_1, P_2, \dots, P_n \vdash Q.

14
New cards

Argument

A relationship between a set of propositions P1,P2,…,PnP_1, P_2, \dots, P_n called premises, and another proposition QQ, called the conclusion, denoted by P1,P2,…,Pn⊢QP_1, P_2, \dots, P_n \vdash Q.

15
New cards

Premises

The set of initial propositions P1,P2,…,PnP_1, P_2, \dots, P_n in an argument from which a conclusion is drawn.

16
New cards

Conclusion

The resulting proposition QQ in an argument that is inferred from the premises.

17
New cards

Valid Argument

An argument P1,P2,…,Pn⊢QP_1, P_2, \dots, P_n \vdash Q that is valid if and only if (P1∧P2∧⋯∧Pn)→Q(P_1 \land P_2 \land \dots \land P_n) \rightarrow Q is a tautology.

18
New cards

Tautology

A compound proposition whose truth value is always true under every possible combination of truth values of its constituent propositions.