2. Revisit Gödel Methods
We first introduce the Gödel numbering method. Mathematical language always deals with symbols, formulas, and derivations. For a mathematical framework, even though its base domains (such as real or complex fields) are uncountable infinities (i.e., the continuum), the number of symbols used to denote variables, functions, operators, etc., is infinite but countably many. Thus, we can have an effective procedure to mechanically assign a unique odd number to each and every symbol in order, called the Gödel number.
Definition 1 (Gödel number of a symbol). For a given symbol e, its Gödel number can be written as which can be seen as a function or an odd number.
Definition 2 (the Gödel number of a formula). A formula is a finite string of symbols, written as
The Gödel number of a formula
can be calculated by
where
is the first
i prime numbers in its natural order, and
is the Gödel number of the
ith symbol in the formula
L.
Definition 3 (the Gödel number of a derivation). A derivation is a finite sequence of formulas, written as
. The Gödel number of a derivation can be calculated by
where
is the Gödel number of the
ith formula in the sequence of a derivation (proof). The Gödel number of any given formula or derivation is always an even number, which is also a composite number.
The above method is called Gödel numbering. The beauty and power of Gödel numbering is that, based on the fundamental theorem of arithmetic (i.e., the unique decomposition theorem of primes), from a given Gödel number we can uniquely recapture the original derivation, the original formula, or the original symbol used in the context.
A necessary note is worth making here. We assume readers are familiar with the first-order logic (PL), the arithmetic theory (N), and the first-order theory (𝓝) (Margaris, 1967); The system 𝓝 is an integration of PL and N. That integration involves the second formalization. The first order theory is a well-developed mathematical framework. Our plan for further research is to develop the first order metalogic geometry in steps. But as an initial step, we can omit most formal and mathematical descriptions. Rather, we only provide necessary contents to make this paper conceptually self-sufficient and instrumentally self-contained.
In the first order theory, it makes the distinction of the intuitive numbers and the corresponding set-theoretic enumerers. Intuitive natural numbers used in N are given by , and the corresponding enumerers used in 𝓝 are denoted by bold . Enumerers are constructed by starting from the empty set and the so-called successor function, such that , { , and so forth. In the following, we introduce Godel’s theorem first, and Tarski’s theorem second.
Definition 4 (Expressibility). If holds in N, then is provable in 𝓝. If does not hold in N, then ¬ is provable in 𝓝.
Definition 5 (Consistency). For any given formula in 𝓝, either is provable, or else ¬ is provable, but not both.
For a given formula L, denote its proof as Bew(L). Assume , where and are Gödel numbers. We have
Definition 5 (Gödel relation). Assume the relation , then by the expressibility, the corresponding function term is provable (or derivable) in 𝓝.
Gödel constructed a formula,
in which
is a free variable. Let
, by substituting
with
, we have,
This is a so-called self-referential statement.
Gödel First Theorem Neither nor is provable in 𝓝.
We now briefly sketch a proof. First, we prove that is not provable. Assume for contradiction that is provable, then it must have a proof, write , let and , so that . By the expressibility, must be provable in 𝓝; but said that for any, . This contradiction shows that the assumption is impossible. Hence, is not provable in 𝓝.
Second, we prove that is unprovable in 𝓝. Assume for contradiction that is provable. Then by consistency, is unprovable, so that for any j, . Hence, for any j, does not hold in ; by expressibility, , for any. As such, by , we have , which means is provable in 𝓝. This contradicts to the assumption that is unprovable. Thus is unprovable in 𝓝.
The above result shows that the consistency of 𝓝 is independent of 𝓝. Now let us speculate about what expresses. is a self-reflection sentence, it says that is unprovable, and we have just proved it above; thus, is true, but not provable in 𝓝, which by definition means that 𝓝 is incomplete. This is the well-known Gödel Incompleteness Theorem. We now turn to Tarski’s indefinability theorem.
Definition 6 (Definability). Let , and , we can hold a binary relation in . Accordingly, we say is definable in 𝓝, meaning has a model, which is not null.
Tarski introduced a new predicate of being true, denoted by
T, and he constructed a sentence below:
Let
, substituting
by
, we have
Let
, we have
which holds in
; hence,
is definable in 𝓝. Then, by standard logic, we can infer
. Now we show that
T is not definable, meaning its model is null. Denote
by
L. If
L is pre-assumed as true, denote it by
, and write
As such, we may assume for contradiction that
T had a model
X;
Since, i.e.,is the Gödel number of . By the definition of ,we have , hence is definable in 𝓝. However, recalling the logical structure of which is a universally quantified conditional statement, we may infer , i.e., is not true in model ; hence, , which shows that may only be null. In other words, since T has no model, the truth predicate function is arithmetically undefinable.