logic

True and False

True and false denoted by

T, F

respectively are distinct symbols (

T \neq F

Predicate

A predicate is a function

f : X \to {T, F}

for some set

X

Logical And

We define the function

\lor : {T, F} \times {T, F} \to {T, F}

by the following table:

\begin{matrix} T & T & T \\ T & F & F \\ F & T & F \\ F & F & F \end{matrix}

note that we use infix notation for this function.

Logical Negation

We define the function

\neg : {T, F} \to {T, F}

by the following table:

\begin{matrix} p & \neg p \\ T & F \\ F & T \end{matrix}

When working with the negation, we almost never include the parenthesis unless it is really necessary, so you'll see $\neg T = F$ rather than the standard function notation: $\neg (T) = F$

Logical Or

We define

\lor : {T, F} \times {T, F} \to {T, F}

p \lor q : = \neg (\neg p \land \neg q)

Rightward Logical Implication

We define

⟹ : {T, F} \times {T, F} \to {T, F}

p ⟹ q : = \neg p \lor q

Note that even though the above doesn't seem intuitive, it exactly matches your intuition, we know that the only time an implication can be false is when we have the antecdent to be true, but the result false, which is exactly the case for the above definition.

Usually $p$ is called the "antecedent" and $q$ the "consequent".

Leftward Logical Implication

We define

⟸ : {T, F} \times {T, F} \to {T, F}

p ⟸ q : = q ⟹ p

Logical Bi-Implication

We define

⟺ : {T, F} \times {T, F} \to {T, F}

p ⟺ q : = (p ⟹ q) \land (p ⟸ q)

Note that in writing mathematicians will use the word "iff" as short-hand for if and only if, which represents the bi-implication.

Logical And True iff both Arguments are True

p \land q = T ⟺ p = T \land q = T

The above proof might feel a bit meta, indeed, we are using the definition of "iff" that we just defined on this page. The "metaness" is coming from the fact that the "iff" we use in english language is actually the bi-implication which we formally define a bit later in the page (which in-turn is then defined in terms of logical and eventually).

Logical Exclusive Or

We define

\oplus : {T, F} \times {T, F} \to {T, F}

p \oplus q : = (\neg p \land q) \lor (p \land \neg q)

"XOR" is sometimes used in place of it's regular name.

Addition Mod 2 is Associative

Suppose that we have the function

p : {0, 1} \to {0, 1}

defined such that

$p (0, 0) = p (1, 1) = 0$
$p (0, 1) = p (1, 0) = 1$

then it is associative

Let

a, b, c \in {0, 1}

, and consider the equation

p (p (a, b), c) = p (a, p (b, c))

when all of

a, b, c = 0

we have

(p (0, 0) = p (0, 0))

, when exactly one of them is zero, then without loss of generality we get the equation

p (1, 0) = p (0, 1)

, if exactly two of them are ones then we either get an equation of the form

p (0, 0) = p (1, 1)

which holds, or one of the form

p (1, 1) = p (1, 1) = 0

, finally if all are 1 then we get

p (0, 1) = p (1, 0)

, since all equations hold true from the definition then

p

is associative.

Exclusive Or is Associative

For any

x_{1}, x_{2}, x_{3} \in {T, F}

we have that

(x_{1} \oplus x_{2}) \oplus x_{3} = x_{1} \oplus (x_{2} \oplus x_{3})

Consider the bijective mapping

f (T) = 1

and

f (F) = 0

we can see that

f (a \oplus b) = p (f (a), f (b))

, the it follows that

f (\cdot \oplus \cdot)

is associative, therefore so is

\oplus

Sum of Ones Mod 2 becomes 0 iff Even

Since

p

is associative let's use it as a binary operation and temporarily label it as

+

then consider a sequence

(a_{n}) : N_{0} \to {0, 1}

\sum_{i = 0}^{k} a_{n} = 0

if and only if

| {a_{j} : a_{j} = 1} |

is even.

Exclusive Or Evaluates to True iff an odd number of arguments are True

x_{1} \oplus x_{2} \oplus \dots \oplus x_{k} = T

if and only if

\sum_{i = 1}^{k} x_{i}

is odd.

Tautology

We say that a predicate

P : X \to {T, F}

is a tautology iff for every

x \in A, P (x) = T

In mathematics, when we prove a statement, we are actually showing that it is a tautology.

Contrapositive

The following is a tautology

(p ⟹ q) ⟺ (\neg q ⟹ \neg p)

Forced Consequence

The following is a tautology

(T ⟹ p) ⟺ p = T

Arbitrary And

For any

n \in N_{0}

we define arbitrary and as the predicate

⋀ : {T, F}^{n} \to {T, F}

such that for any

X = (x_{1}, \dots, x_{n}) \in {T, F}^{n}

⋀ X = T

if and only if the following statement holds true

\forall i \in {1, \dots, n}, x_{i} = T

Empty And is True

Suppose that

X = ()

(the empty tuple), then

⋀ X = T

where we've used the the arbitrary and

Arbitrary And Indexed Notation

Suppose that,

a, b \in Z

and

p_{a}, \dots p_{b} \in {T, F}

then we define

⋀_{i = a}^{b} p_{i} : = ⋀ (p_{a}, \dots, p_{b})

where we've used the the arbitrary and

Arbitrary And Indexed Notation with Reversed Integers is True

Suppose

a > b \in Z

and

⋀_{i = a}^{b} p_{i} = T

Recall that

⋀_{i = a}^{b} p_{i} = ⋀ (p_{a}, \dots, p_{b})

But at the same time

(p_{a}, \dots, p_{b}) = ()

because

a > b

therefore

⋀ (p_{a}, \dots, p_{b}) = ⋀ ()

and therefore evaluates to true.

Arbitrary And Expanded Notation

Suppose that

p_{1}, \dots p_{n} \in {T, F}

then we define

p_{1} \land \dots \land p_{n} : = ⋀_{i = 1}^{n} p_{i}

where we've used the previous definition

Arbitrary Or

Uniqueness

Suppose that

P : X \to {T, F}

is a predicate, then we say that there is a unique element which satisfies

P

over the set

S \subseteq X

when

\exists s \in S, P (s) \land \forall t \in S, P (t) ⟹ t = s

For Every, There Exists is a Function

The statement

\forall x \in X, \exists y \in Y, P (x, y)

is equivalent to

\exists f : X \to Y, \forall x \in X, P (x, f (x))

🏗️ ΘρϵηΠατπ🚧 (under construction)

🏗️ $Θ ρ ϵ η Π α τ π$ 🚧 (under construction)