From e9d73011b32448fe1429e8caab9f6eedc882c15d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Abdulkadir=20Furkan=20=C5=9Eanl=C4=B1?= Date: Tue, 17 Dec 2019 16:32:27 +0100 Subject: [PATCH] Regen with latest hugo MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Abdulkadir Furkan Şanlı --- public/about/index.html | 13 ++++----- public/index.html | 7 +++-- public/index.xml | 7 +++-- public/posts/eidma/index.html | 39 +++++++++++++++---------- public/posts/index.html | 5 +++- public/posts/index.xml | 5 +++- public/tags/university-notes/index.html | 5 +++- public/tags/university-notes/index.xml | 5 +++- 8 files changed, 56 insertions(+), 30 deletions(-) diff --git a/public/about/index.html b/public/about/index.html index 545d1b3..e57bb2b 100644 --- a/public/about/index.html +++ b/public/about/index.html @@ -6,7 +6,7 @@ - + @@ -29,7 +29,7 @@ - + @@ -38,7 +38,7 @@ - + @@ -147,17 +147,16 @@
-

- +

  • name: Abdulkadir Furkan Şanlı
  • handle: abdulocracy
  • contact: -
    • email: my handle at disroot dot org
    • irc (freenode): abdulocracy
      • -
    • +
+
diff --git a/public/index.html b/public/index.html index 246b830..2a114b2 100644 --- a/public/index.html +++ b/public/index.html @@ -1,7 +1,7 @@ - + abdulocracy's personal site @@ -167,7 +167,10 @@
- Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. We should avoid variables when forming statements, as they may change the logical value. (2=7) statement (x=5) not a statement In logic we do not use the equals sign, we use the equivalence sign (\equiv). Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. + Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. +We should avoid variables when forming statements, as they may change the logical value. +(2=7) statement (x=5) not a statement In logic we do not use the equals sign, we use the equivalence sign (\equiv). +Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc.
diff --git a/public/index.xml b/public/index.xml index 0a267de..1ea1082 100644 --- a/public/index.xml +++ b/public/index.xml @@ -18,7 +18,10 @@ Wed, 20 Nov 2019 00:00:00 +0000 https://abdulocra.cy/posts/eidma/ - Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. We should avoid variables when forming statements, as they may change the logical value. \(2=7\) statement \(x=5\) not a statement In logic we do not use the equals sign, we use the equivalence sign \(\equiv\). Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. + Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. + We should avoid variables when forming statements, as they may change the logical value. + \(2=7\) statement \(x=5\) not a statement In logic we do not use the equals sign, we use the equivalence sign \(\equiv\). + Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. @@ -27,7 +30,7 @@ Mon, 04 Nov 2019 00:00:00 +0000 https://abdulocra.cy/about/ - name: Abdulkadir Furkan Şanlı handle: abdulocracy contact: email: my handle at disroot dot org irc (freenode): abdulocracy + name: Abdulkadir Furkan Şanlı handle: abdulocracy contact: email: my handle at disroot dot org irc (freenode): abdulocracy diff --git a/public/posts/eidma/index.html b/public/posts/eidma/index.html index 05cb824..97e0f95 100644 --- a/public/posts/eidma/index.html +++ b/public/posts/eidma/index.html @@ -6,7 +6,10 @@ - + @@ -29,7 +32,10 @@ - + @@ -38,7 +44,10 @@ - + @@ -158,19 +167,19 @@

Propositional calculus

-
  • Not necessarily connectives but unary operations: +

  • Not necessarily connectives but unary operations:

    • Negation: Denoted by ~, \(\neg\) or NOT, negates the one input \((10)\).
    • -
  • A (propositional) formula is a “properly constructed” logical expression. +

  • A (propositional) formula is a “properly constructed” logical expression.

    • e.g. \(\neg[(p \lor q)] \land r\)
    • \((p \land)\) is not a formula, as \(\land\) requires 2 variables.
      • @@ -196,10 +205,10 @@
    • \(\neg(B \lor C)\) can be written as \(\neg B \land \neg C\)
    • -
  • Double negation law: \(\neg(\neg p) \equiv p\)
    • +

  • Double negation law: \(\neg(\neg p) \equiv p\)

  • De Morgan’s laws: \(\neg(p \land q) \equiv \neg p \lor \neg q\) and \(\neg(p \lor q) \equiv \neg p \land \neg q\).

    • -
  • If and only if (iff): \(p \iff p \equiv (p \implies q) \land (q \implies p)\)
    • -
  • Contraposition law: +

  • If and only if (iff): \(p \iff p \equiv (p \implies q) \land (q \implies p)\)

    • +

  • Contraposition law:

    • \((p \implies q) \equiv (\neg q \implies \neg p)\) prove by contraposition
        @@ -207,7 +216,7 @@
      • \((\neg q \implies \neg p) \equiv (\neg (\neg q) \lor (\neg p) \equiv (q \lor \neg p) \equiv (\neg p \lor q)\)
    • -
  • Contradiction law: +

  • Contradiction law:

    • \(p \lor \neg p \equiv 1\) and \(p \land \neg p \equiv 0\)
    • diff --git a/public/posts/index.html b/public/posts/index.html index bcd9e7a..e30dda2 100644 --- a/public/posts/index.html +++ b/public/posts/index.html @@ -164,7 +164,10 @@
    - Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. We should avoid variables when forming statements, as they may change the logical value. (2=7) statement (x=5) not a statement In logic we do not use the equals sign, we use the equivalence sign (\equiv). Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. + Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. +We should avoid variables when forming statements, as they may change the logical value. +(2=7) statement (x=5) not a statement In logic we do not use the equals sign, we use the equivalence sign (\equiv). +Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc.
    diff --git a/public/posts/index.xml b/public/posts/index.xml index 737366e..71b8b8f 100644 --- a/public/posts/index.xml +++ b/public/posts/index.xml @@ -18,7 +18,10 @@ Wed, 20 Nov 2019 00:00:00 +0000 https://abdulocra.cy/posts/eidma/ - Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. We should avoid variables when forming statements, as they may change the logical value. \(2=7\) statement \(x=5\) not a statement In logic we do not use the equals sign, we use the equivalence sign \(\equiv\). Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. + Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. + We should avoid variables when forming statements, as they may change the logical value. + \(2=7\) statement \(x=5\) not a statement In logic we do not use the equals sign, we use the equivalence sign \(\equiv\). + Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. diff --git a/public/tags/university-notes/index.html b/public/tags/university-notes/index.html index c3a8966..bab16c0 100644 --- a/public/tags/university-notes/index.html +++ b/public/tags/university-notes/index.html @@ -164,7 +164,10 @@
    - Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. We should avoid variables when forming statements, as they may change the logical value. (2=7) statement (x=5) not a statement In logic we do not use the equals sign, we use the equivalence sign (\equiv). Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. + Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. +We should avoid variables when forming statements, as they may change the logical value. +(2=7) statement (x=5) not a statement In logic we do not use the equals sign, we use the equivalence sign (\equiv). +Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc.
    diff --git a/public/tags/university-notes/index.xml b/public/tags/university-notes/index.xml index f8316aa..44836a0 100644 --- a/public/tags/university-notes/index.xml +++ b/public/tags/university-notes/index.xml @@ -18,7 +18,10 @@ Wed, 20 Nov 2019 00:00:00 +0000 https://abdulocra.cy/posts/eidma/ - Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. We should avoid variables when forming statements, as they may change the logical value. \(2=7\) statement \(x=5\) not a statement In logic we do not use the equals sign, we use the equivalence sign \(\equiv\). Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc. + Mathematics without infinitely small, continuous mathematical objects. The mathematics of finite sets. Propositional calculus Comes from the linguistic concept that things can be either true or false. + We should avoid variables when forming statements, as they may change the logical value. + \(2=7\) statement \(x=5\) not a statement In logic we do not use the equals sign, we use the equivalence sign \(\equiv\). + Logical values (booleans) are denoted by either 0 or 1 (or t, f, etc.