Autosave: 2022-12-23 15:00:06
This commit is contained in:
parent
333e176886
commit
a18fcb7e4a
3 changed files with 22 additions and 17 deletions
|
@ -1,11 +1,13 @@
|
|||
---
|
||||
categories:
|
||||
- Mathematics
|
||||
tags: [logic, theorems]
|
||||
- Logic
|
||||
tags: [propositional-logic]
|
||||
---
|
||||
|
||||
# Law of Non-Contradiction
|
||||
|
||||
> A proposition cannot be true and false at the same time.
|
||||
>
|
||||
> $$
|
||||
> \\sim (P & \sim P)
|
||||
> $$
|
||||
|
||||
$$
|
||||
\lnot (P \land \lnot P)
|
||||
$$
|
||||
|
|
|
@ -1,11 +1,13 @@
|
|||
---
|
||||
categories:
|
||||
- Mathematics
|
||||
tags: [theorems, logic]
|
||||
- Logic
|
||||
tags: [propositional-logic]
|
||||
---
|
||||
|
||||
# Law of the Excluded Middle
|
||||
|
||||
> Every proposition has to be either true or false. There can be no middle ground.
|
||||
>
|
||||
> $$
|
||||
> P \lor \sim P
|
||||
> $$
|
||||
|
||||
$$
|
||||
P \lor \sim P
|
||||
$$
|
||||
|
|
|
@ -1,13 +1,14 @@
|
|||
---
|
||||
categories:
|
||||
- Mathematics
|
||||
tags: [logic]
|
||||
- Logic
|
||||
tags: [propositional-logic]
|
||||
---
|
||||
|
||||
We know that when we construct a [derivation](Formal%20proofs%20in%20propositional%20logic.md#constructing-proofs) we start from a set of assumptions and then attempt to reach a proposition that is a consequence of the starting assumptions. However it does not always have to be the case that the starting set contains members. The set can in fact be empty.
|
||||
We know that when we construct a [derivation](/Logic/Proofs/Formal_proofs_in_propositional_logic.md#derivation-rules) we start from a set of assumptions and then attempt to reach a proposition that is a consequence of the starting assumptions. However it does not always have to be the case that the starting set contains members. The set can in fact be empty.
|
||||
|
||||
_Demonstration_
|
||||

|
||||
|
||||

|
||||
|
||||
We see in this example that there is no starting set and thus no primary assumptions. Instead we start with nothing other than the proposition we wish to derive. The proposition is effectively derived from itself. In these scenarios we say that we are constructing a derivation from an **empty set**.
|
||||
|
||||
|
@ -18,7 +19,7 @@ Propositions which possess this property are called theorems:
|
|||
We represent a theorem as:
|
||||
|
||||
$$
|
||||
\\vdash P
|
||||
\vdash P
|
||||
$$
|
||||
|
||||
(There is no preceding $\Gamma$ as the set is empty. )
|
||||
|
|
Loading…
Add table
Reference in a new issue