goo

The inconsistency theorem

2021-03-01 05:21:42 | Mathematics
                               1

I found a new paradox of the set theory. The mathematicians must surmount it.
                                2

Let X be the countable set of the logical formulas which are the theorems of the standard mathematics.
(0∉N")∧(1∈N")∧∀x∀y((x∈N")∧(y∈N")→(x+y∈N")) ∈X etc.. N" becomes N in the standard model of X.
(x∈N) ⇔ (x=1)∨(x=2)∨(x=3)∨…(infinitely).
Let's see this X as an axiom system.
Theorem 1. X isn't consistent.
Proof. Assume that X is consistent. Let d be an individual symbol which X doesn't include.
Put Y=X∪{d-n∈N" |n∈N}=X∪{d-1∈N",d-2∈N",…}. If Y isn't consistent, Y|- 1≠1.
∃n1…∃nm((n1N)∧…∧(nmN)∧(X∪{d-n1∈N",…,d-nm∈N"} |-1≠1)). The ni's don't include d.
niN. So X |- ni=1+…+1∈N". Put w(x)=(x-n1∈N")∧…∧(x-nm∈N").
X∪{w(d)} isn't consistent. X |- ¬w(d). X doesn't include d. X |-∀x(¬w(x)). Put p=n1+…+nm.
X |- ¬w(p). X |- n2+…+nm=p-n1∈N", …,X |- n1+…+nm-1=p-nm∈N". X |- w(p). X isn't consistent.
(Y |- 1≠1. ⇒ X |- 1≠1) is true. If d=1, Y |- 0=d-1∈N". But Y⊃X |- 0∉N". Y isn't consistent then.
((d=1)⇒ Y |- 1≠1) is true. ((d=1)⇒ X |- 1≠1) is true. X doesn't include d and X is consistent.
So d=1 is false. d≠1 is a tautology. X |- d≠1. X |- ∀x(x≠1). X |- 1≠1. This is contradiction.♦
This theorem may be the reason why Gauss didn't admit the infinite set as ghastly one.
The millennium problems and abc conjecture are solved as nonsense by using the set N.
                                            3

The above brings only destruction in the mathematics but its application brings great benefit. Every phenomenon
like reversal of the time becomes possible if you can lead 1+1=3.
goo | コメント ( 0 ) | トラックバック ( 0 )