Commit 955b11036a9990385e5b43118fd7b1bc247bdd9e
2020-05-17T12:14:58
modal logic
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65
diff --git a/Makefile b/Makefile
index f2ec9a6..69bbbe2 100644
--- a/Makefile
+++ b/Makefile
@@ -3,12 +3,19 @@ FONTSIZE = 8pt
MD = \
bsd \
+ modal-logic \
pandoc \
railsonlisp \
test
TEX =
+PDF = \
+ bsd.pdf \
+ pandoc.pdf \
+ railsonlisp.pdf \
+ test.pdf
+
all: pdf
clean:
@@ -18,10 +25,6 @@ clean:
%.pdf: %/index.md
cd "${@:%.pdf=%}" && pandoc -st beamer -V theme:${THEME} -V fontsize:${FONTSIZE} -o ../$@ -f gfm index.md
-PDF = \
- ${MD:%=%.pdf} \
- ${TEX:%=%.tex.pdf}
-
pdf: ${PDF}
.PHONY: all clean pdf
diff --git a/modal-logic/index.md b/modal-logic/index.md
new file mode 100644
index 0000000..75f2f81
--- /dev/null
+++ b/modal-logic/index.md
@@ -0,0 +1,24 @@
+# Modal logic
+
+## 1. Notation
+¬A "Not A"
+
+□A "It is necessary that A"
+
+◊A "It is possible that A"
+
+A → B "If A then B"
+
+## 2. Contruction
+K is a weak logic (Saul Kripke)
+
+### 2.1 Necessitation rule
+A is a theorem of K → □A is a theorem of K
+
+### 2.2 Distribution axiom
+□(A → B) → (□A → □B)
+
+## 3. T
+T is K plus the following axiom :
+
+□A → A