You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: pages/entailment.md
+25-5
Original file line number
Diff line number
Diff line change
@@ -1,14 +1,16 @@
1
1
# Entailment
2
2
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.
4
6
5
7
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:
6
8
7
9
```
8
10
P₁, P₂ ... ⊧ Q
9
11
```
10
12
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.
12
14
13
15
The intuitive definition of entailment is the following:
14
16
@@ -34,7 +36,7 @@ The following video introduces the idea of entailment by examples.
34
36
35
37
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.
36
38
37
-
### A entails A
39
+
### “A” entails “A”
38
40
39
41
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:
40
42
@@ -59,7 +61,7 @@ Now, to check the entailment we have to check: for every valuation (row), if all
59
61
60
62
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`.
61
63
62
-
### A and B entails A
64
+
### “A and B” entails “A”
63
65
64
66
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:
65
67
@@ -83,10 +85,24 @@ Together, for each row, we have that if the assumption is true, then the conclus
83
85
84
86
TBD
85
87
86
-
### Modus Ponens
88
+
| A (valuation) | B (valuation) | A \lor B (assumption) | A (conclusion) |
0 commit comments