【离散数学】 SEU - 02 - 2021/03/05 - Applications of Propositional Logic and Propositional Equivalences

最新推荐文章于 2022-08-23 06:00:14 发布

Teddy van Jerry

最新推荐文章于 2022-08-23 06:00:14 发布

阅读量241

点赞数

分类专栏：【离散数学】文章标签：离散数学数学 Mathematics

本文链接：https://blog.csdn.net/weixin_50012998/article/details/114383689

版权

【离散数学】专栏收录该内容

43 篇文章 6 订阅

订阅专栏

Discrete Mathematics and its Applications (8th Edition)
2021/03/05 - Applications of Propositional Logic and Propositional Equivalences

1 The Foundations: Logic and Proofs

1 The Foundations: Logic and Proofs

1.2 Applications of Propositional Logic

1.2.2 Translating English Sentences

1.2.3 System Specifications

Example: “The automated reply cannot be sent when the file system is full.”
Solution: $p\rightarrow \neg p$

A list of propoitions is consistent if it is possible to assign truth value to the propositional varibles so that each proposition is true.

1.2.5 Logic Puzzles

Example: An island has two kinds of inhabitants, knights, who always tell the truth while knaves always lie. A says “B is a knight”, B says “We are different types of people.” What are the types of A and B?

Logic Circuits

Inventer ( $\neg$ )
OR gate ( $\vee$ )
AND gate ( $\wedge$ )

1.3 Propositional Equivalences

1.3.1 Introductions

A compound proposition that is always true, no matter what the truth values of the propositional variables that occur in it, is called a tautology. A compound proposition that is always false is called a contradiction. A compound proposition that is neither a tautology nor a con- tradiction is called a contingency.

1.3.2 Logical Equivalences

The compound propositions $p$ and $q$ are called logically equivalent if $\leftrightarrow q$ is a tautology. The notation $\equiv q$ denotes that $p$ and $q$ are logically equivalent. The symbol $\Leftrightarrow$ is sometimes used instead of $\equiv$ .

Exapmle:

$\neg p\vee q$ is equivalent to $p\rightarrow q$ .
$\neg(p\wedge q)\equiv \neg p \vee \neg q$ [De morgan's Law I]
$\neg(p\vee q)\equiv \neg p \wedge \neg q$ [De morgan's Law II]

Identity Laws
Domination Laws
Idempotent Laws
Double Negation Law
Negation Laws
Commutative Laws
Associative Laws
Distributive Laws
Absorption Laws

Disjunctive Normal Form

A literal is a propositional variable or its negation.

formula is in disjunctive normal form (DNF) iff it is a disjunction of conjuctions of literals.

Theorem: Every proposition can be put into an quivalent DNF.

Proof:

Emininate all operators except for negation, conjunction and disjunction by substituting logically equivalent formulas:

$A\rightarrow B\equiv \neg A\vee B$
$A\leftrightarrow B\equiv (A\rightarrow B)\wedge (B\rightarrow A)$
$A\oplus B\equiv (A\rightarrow B)\vee\neg(B\rightarrow A)$

push negations inward using De Morgan’s laws:

$\neg(A\wedge B)\equiv \neg A \vee \neg B$ [De morgan's Law I]
$\neg(A\vee B)\equiv \neg A \wedge \neg B$ [De morgan's Law II]
until they appear only before atomic propositions or atomic propositions preseded by negations.

Eliminating sequences of negations by deleting double negation operators:

$\neg\neg A\equiv A$

The formula now consists of disjunctions and conjuctions of literals. Use the distrubutive laws:

$A\wedge(B\vee C)\equiv(A\wedge B)\vee(A\wedge C)$
to eliminate disjunctions within conjuctions.