Ontologischer Beweis

S

Sheshbazzar

Guest
Gödel's Original. Transcript: 0 & 1.

Code: 
Th. 1
G(x)
    A(x)
        ~P(A)
            P(~A)   : P(X) xor P(~X)
            ~A(x)   : P(X) => X(x)
    (A)[A(x) => P(A)]
    A(x)
        G(y)
            P(A)    : see above
            A(y)    : P(X) => X(y)
        (y)[G(y) => A(y)]
        N(y)[G(y) => A(y)]  : if there is a proof of X then NX
    (A)[A(x) => N(y)(G(y) => A(y))]
G(x) => (A)[A(x) => N(y)(G(y) => A(y))]
G(x) => G Ess x

Th. 2
G(x)
    E(x)    : P(E) & P(X) => X(x)
    G Ess x
    N(Ex)G(x)   : E(x) = (A)[A Ess x => N(Ex)A(x)]
G(x) => N(Ex)G(x)

Hence (Ex)G(x) => N(Ex)G(x)
"   "   M(Ex)G(x) => MN(Ex)G(x)
"               " => N(Ex)G(x)  : MNX => NX
Now is M(Ex)G(x)? Of course it is, for if ~M(Ex)G(x) then G(x) => ~G(x) i.e., P(~G) in contradiction with the ax. P(X) xor P(~X).
Hence N(Ex)G(x) i.e., it is necessary that there exists a Being having all the positive properties & only these.
 
P(G) holds because P(X) & P(Y) => P(X & Y). Consider the multitude of the positive properties i.e., having the property P. There is a property that is the conjunction of all these positive properties, namely G. According to ax. 1, G is itself positive i.e., P(G).

Gödel's proof is clever. The essence of essence is grasped. The compatibility of G, analogous to consistency, is established thanks to the analogy of P with truth. For example "X is either true or ~X is" = "P(X) xor P(~X)", "if X, Y are true then X & Y is also true" = "P(X) & P(Y) => P(X & Y)", "if X is true & X => Y also true then so is Y" = [P(X) & N(X => Y)] => P(Y).
 
If this is your idea of an "explanation", we need to have a talk on what the definition of that word is. For one, it would be useful to know what the terms stand for. For another is it not relevant what values one gives to the terms? Plugging in different values would achieve different results would it not?
 
GK, you are correct. The assumption is that Gödel's Proof is proof that is beyond the realm of mathematics... not what he claimed at all.
 
You must log in or register to reply here.
Back
Top