Concise Formalization of the Liar Paradox

The Liar Paradox refers to itself when it says: {This sentence is not true}
In order to mathematically formalize every aspect of the Liar Paradox as predicate logic, I had to enhance the way that predicate logic works.

Defining Self-Reference Semantics <assign alias name> operator
LHS is assigned as an alias name for the RHS
LHS ≡ RHS
The LHS is logically equivalent to the RHS only Because the LHS is merely an alias name for the RHS

LiarParadox ≡ ~True(LiarParadox).
The name and alias name operator are merely notational conventions for translating the meaning: {This sentence is not true} into predicate logic.

Translation into directed acyclic graph
01 LiarParadox (02)
02 Not         (03)
03 True        (01) 
// infinite evaluation loop

Here is how {alias name} works in computer science:
In computer science variable names to refer to memory addresses. Variable names are considered one and the same thing as the memory address. When a computer program is compiled the names are translated into these memory addresses and discarded.

// The Liar Paradox in C++
Test the value of a variable before this variable has a value
then assign this non-existent value to this variable.
bool Liar_Paradox = (Liar_Paradox == false);

This statement is semantically analogous to the one above
in that the quotient of division by zero does not exist.
double BadNumber = 1.0 / 0.0;

 

Copyright 2016, 2017 2018 Pete Olcott