Skip to content

Commit c4e773c

Browse files
committed
[ pages ] minor updates to entailment page
1 parent fb74aa5 commit c4e773c

File tree

1 file changed

+25
-5
lines changed

1 file changed

+25
-5
lines changed

pages/entailment.md

+25-5
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,16 @@
11
# Entailment
22

3-
One of the uses of logic (and possibly the most important one) is to identify when conclusions do and do not follow from some assumptions. Logic does not concern itself with whether or not whether or not the assumptions are actualy true, only the question of whether or not the things we are assuming are sufficient to conclude some other property.
3+
One of the uses of logic (and possibly the most important one) is to identify when conclusions do and do not follow from some assumptions.
4+
5+
Logic does not concern itself with whether or not whether or not the assumptions are actually true, only the question of whether or not the formulas we are assuming are sufficient to conclude some other formula.
46

57
If a conclusion `Q` follows from some assumptions `P₁, P₂...` (in a rigorous way we define below), we will say that the assumptions `P₁, P₂...` *entails* `Q`. I will also write this in symbols:
68

79
```
810
P₁, P₂ ... ⊧ Q
911
```
1012

11-
The assumptions `P₁, P₂...` may be finitely or infinitely many, though we will usually only be interested in finite numbers of assumptions.
13+
The assumptions `P₁, P₂...` may be finitely or infinitely many, though we will usually only be interested in finitely many assumptions.
1214

1315
The intuitive definition of entailment is the following:
1416

@@ -34,7 +36,7 @@ The following video introduces the idea of entailment by examples.
3436

3537
For Propositional Logic, it is possible to compute entailments by using truth tables. Let's see how to do this by some examples. These examples will also introduce some of the interesting consequences of the definition of entailment.
3638

37-
### A entails A
39+
### “A” entails “A”
3840

3941
Our first example is the entailment `A \models A`. Inituitively, this entailment ought to hold: if we assume `A`, then we should be able to conclude `A`. Let us check this by writing a truth table. We first write out all the possible values of `A`. These are all our different valuations, so we explicitly mark these columns as our valuation:
4042

@@ -59,7 +61,7 @@ Now, to check the entailment we have to check: for every valuation (row), if all
5961

6062
Checking this table, we can see that the entailment holds. In the first row, the assumption is false, so we are OK. In the second row, the assumption is true, but so is the conclusion, so we are OK. After checking every row, we can conclude that `A \models A`.
6163

62-
### A and B entails A
64+
### A and B entails “A”
6365

6466
The entailment `A \land B \models A` is a little more complex because there are two propositional atoms `A` and `B`. I will write out the table all in one go:
6567

@@ -83,10 +85,24 @@ Together, for each row, we have that if the assumption is true, then the conclus
8385

8486
TBD
8587

86-
### Modus Ponens
88+
| A (valuation) | B (valuation) | A \lor B (assumption) | A (conclusion) |
89+
|---------------|---------------|-----------------------|----------------|
90+
| F | F | F | F |
91+
| F | T | T | F |
92+
| T | F | T | T |
93+
| T | T | T | T |
94+
95+
### Implication internalises entailment
8796

8897
TBD
8998

99+
| A (valuation) | B (valuation) | A \to B (assumption) | A (assumption) | B (conclusion) |
100+
|---------------|---------------|----------------------|----------------|----------------|
101+
| F | F | | | |
102+
| F | T | | | |
103+
| T | F | | | |
104+
| T | T | | | |
105+
90106
### Entailment with no assumptions
91107

92108
TBD
@@ -95,6 +111,10 @@ TBD
95111

96112
TBD
97113

114+
| A (valuation) | B (valuation) | A (assumption) | ¬A (assumption) | B (conclusion) |
115+
|---------------|---------------|----------------|-----------------|----------------|
116+
| | | | | |
117+
98118
## Facts about entailment
99119

100120
### Substitution

0 commit comments

Comments
 (0)