All you have "advanced" is a THEORY of IN-CONSISTENCY which interrupts
EVERY SINGLE LOGIC TEXT.
WM and many others have been trying to post more fundamental theories
for decades that are not "STOOPID".
You wouldn't call this a MISSING ROW would you??
0.xoooo..
0.oooxo..
0.ooxoo..
0.oxooo..
0.oooox..
..
but you call this a missing row!
A WITNESS TO SIZE > INFINITY!!
0.xoooo..
0.oxooo..
0.ooxoo..
0.oooxo..
0.oooox..
..
Why don't you ADDRESS the NUMEROUS OBVIOUS BLATANT FLAWS
based on your MISCONCEPTION that
ALL(F):N->R E(r):R ALL(n):N r =/= F(n)
is somehow mysteriously proven in FOL!
Before you waste your time making 20 more equivalent theories to ZFC
that actually prove this in 2OL since you are quantifying over all
lists or functions..
Try addressing your oversights!
*****************************************************
*****************************************************
Q1
What are 2 missing reals from this List using Cantor's method?
LIST
0.100..
0.000..
0.001..
..
LIST'
0.000.. (Old Row 2)
0.100.. (Old Row 1)
0.001..
..
*****************************************************
*****************************************************
Q2
Why is this GODEL NUMBER BARRED from a theory?
20032104211598200321042105
a00(a10,a11)=!a00(a10,a10)
x e y <-> NOT(x e x)
RUSSELL'S SET
*****************************************************
*****************************************************
Q3
And this GODEL NUMBER is a prerequisite of all theories > PA?
8203215
!a0(a1)
NOT(PROOF(GN#))
GODEL'S STATEMENT
*****************************************************
*****************************************************
Q4
How can there be uncountable many GODEL NUMBERS like this?
20130415
a01(0,1)
MIDPOINT(0,1)
A CHOICE FUNCTION
*****************************************************
*****************************************************
Q5
Which 1 of these does not hold?
a) N <-BIJECTS-> GODEL NUMBERS
b) GODEL NUMBERS <-BIJECT-> FUNCTIONS
c) CHOICE FUNCTIONS <-BIJECT-> SETS
d) |SETS| > |N|
*****************************************************
*****************************************************
Q6
Does this Anti-Diagonal Method produce any unique digit segment not
listed?
AD METHOD
Choose the number 0.a_1a_2a_3...., where a_i = 1 if the i-th
number in your list had zero in its i-position, a_i = 0 otherwise.
LIST
R1= < <314><15><926><535><8979><323> ... >
R2= < <27><18281828><459045><235360> ... >
R3= < <333><333><333><333><333><333> ... >
R4= < <888888888888888888888><8><88> ... >
R5= < <0123456789><0123456789><01234 ... >
R6= < <1><414><21356><2373095><0488> ... >
....
*****************************************************
*****************************************************
G. Cooper (BInfTech)
--
http://tinyURL.com/BLUEPRINTS-THEOREM
http://tinyURL.com/BLUEPRINTS-TURING
http://tinyURL.com/BLUEPRINTS-GODEL
http://tinyURL.com/BLUEPRINTS-PROOF
http://tinyURL.com/BLUEPRINTS-MATHS
http://tinyURL.com/BLUEPRINTS-LOGIC
http://tinyURL.com/BLUEPRINTS-BRAIN
http://tinyURL.com/BLUEPRINTS-REAL
http://tinyURL.com/BLUEPRINTS-SETS
http://tinyURL.com/BLUEPRINTS-HALT
http://tinyURL.com/BLUEPRINTS-P-NP
http://tinyURL.com/BLUEPRINTS-GUT
http://tinyURL.com/BLUEPRINTS-AI
LOGIC AXIOM - The Closure Of Tautologies
E(Y) Y={x|f(x)} <-> PROOF( E(Y) Y={x|f(x)} )
MATHEMATICS AXIOM - The Examination of Theories
E(Y) Y={x|f(x)} <-> !PROOF( !E(Y) Y={x|f(x)} )
PROOF(C) :- C
PROOF(C) :- DERIVE(A,B,C)
DERIVE(A,B,C) :- PROOF(A), PROOF(B), TAUT(A,B,C)
8203215 = GODEL NUMBER
!A0(A1) = NOT(PROOF(8203215)) <-/-> E(Y) Y={x|f(x)}
10 IF HALT(this-program-ref) THEN GOTO 10
ORIGINS OF CHAITAN'S OMEGA AND |R|>|N|
************
| 5GL / WHY? WHEN?
| 4GL / WHAT? not HOW! ?person(P)
| 3GL / FUNCTION STACK proc(a,b)
| 2GL / MNEMONICS LDA 0101
| 1GL/ MACHINE CODE 101 0101
===
CPU