Gödel's Ontological Argument

Kurt Gödel, in Dana Scott's version

The argument is valid.

Every inference was checked by machine. All 2 objections are answered.

Open in the playground

flowchart TD
    classDef axiom fill:#f6efd9,stroke:#a8842a,color:#23212b;
    classDef premise fill:#e7edf7,stroke:#1f4e9c,color:#23212b;
    classDef deduction fill:#f3f4f1,stroke:#5b6b85,color:#23212b;
    classDef conclusion fill:#d6e1f3,stroke:#1f4e9c,stroke-width:3px,color:#23212b;
    classDef objection fill:#f7e3e1,stroke:#b3261e,color:#23212b;
    classDef reply fill:#f3f4f1,stroke:#7a5c2e,color:#23212b;
    classDef imported stroke-dasharray:4 3;
    classDef defeated fill:#f3f4f1,stroke:#b3261e,stroke-dasharray:6 3,color:#8a8796;
    classDef undecided stroke-dasharray:2 2;
    classDef overruled fill:#f3f4f1,stroke:#c9ccc6,color:#8a8796;
    Godel(["Godel: Kurt Gödel, Ontologischer Beweis, 1970"]):::axiom
    Scott(["Scott: Dana Scott, notes on Gödel's<br/>ontological proof, 1972"]):::axiom
    A1["<b>A1</b>: Necessarily, a property is positive<br/>exactly when its negation is not.<br/><i>□∀F:prop. Positive(λx. ¬F(x)) ↔<br/>¬Positive(F)</i>"]:::premise
    A2["<b>A2</b>: Necessarily, a property necessarily<br/>entailed by a positive property is<br/>positive.<br/><i>□∀F:prop. ∀H:prop. Positive(F) ∧<br/>□∀x. F(x) → H(x) → Positive(H)</i>"]:::premise
    A3["<b>A3</b>: Necessarily, being God-like (having<br/>every positive property) is positive.<br/><i>□Positive(G)</i>"]:::premise
    A4["<b>A4</b>: Necessarily, a positive property is<br/>necessarily positive.<br/><i>□∀F:prop. Positive(F) → □Positive(F)</i>"]:::premise
    A5["<b>A5</b>: Necessarily, necessary existence is<br/>positive.<br/><i>□Positive(NE)</i>"]:::premise
    T1["<b>T1</b>: A positive property is possibly<br/>exemplified.<br/><i>∀F:prop. Positive(F) → ◇∃x. F(x)</i>"]:::deduction
    Cor["<b>Cor</b>: Possibly, a God-like being exists.<br/><i>◇∃x. G(x)</i>"]:::deduction
    T2["<b>T2</b>: Necessarily, being God-like is the<br/>essence of any God-like being.<br/><i>□∀x. G(x) → Ess(G, x)</i>"]:::deduction
    T3["<b>T3</b>: Necessarily, a God-like being exists.<br/><i>□∃x. G(x)</i>"]:::conclusion
    O1{{"<b>O1</b>: Gödel never defines a positive<br/>property, so nothing guarantees the<br/>axioms describe anything coherent."}}:::objection
    R1{{"<b>R1</b>: Automated model finders have exhibited<br/>models of Scott's axioms (Benzmüller<br/>and Woltzenlogel Paleo, 2014), so they<br/>are consistent."}}:::reply
    O2{{"<b>O2</b>: Sobel showed that the axioms entail<br/>modal collapse: every truth becomes a<br/>necessary truth."}}:::objection
    R2{{"<b>R2</b>: Emended axiom systems, such as<br/>Anderson's, block the collapse while<br/>keeping the conclusion."}}:::reply
    class O1 overruled
    class O2 overruled
    Godel -.-> A1
    Scott -.-> A1
    Godel -.-> A2
    Scott -.-> A2
    Godel -.-> A3
    Scott -.-> A3
    Godel -.-> A4
    Scott -.-> A4
    Godel -.-> A5
    Scott -.-> A5
    A1 --> T1
    A2 --> T1
    T1 --> Cor
    A3 --> Cor
    A1 --> T2
    A4 --> T2
    Cor --> T3
    T2 --> T3
    A5 --> T3
    O1 -. objects .-> A1
    R1 -. replies .-> O1
    O2 -. objects .-> T3
    R2 -. replies .-> O2

Sources

Godel
Kurt Gödel, Ontologischer Beweis, 1970
Scott
Dana Scott, notes on Gödel's ontological proof, 1972

Definitions

G(x)
∀F:prop. Positive(F) → F(x)
Ess(F, x)
F(x) ∧ (∀H:prop. H(x) → □∀y. F(y) → H(y))
NE(x)
∀F:prop. Ess(F, x) → □∃y. F(y)

The argument

A1 premise

Necessarily, a property is positive exactly when its negation is not.

□∀F:prop. Positive(λx. ¬F(x)) ↔ ¬Positive(F)

Grounded by Godel, Scott

A2 premise

Necessarily, a property necessarily entailed by a positive property is positive.

□∀F:prop. ∀H:prop. Positive(F) ∧ □∀x. F(x) → H(x) → Positive(H)

Grounded by Godel, Scott

A3 premise

Necessarily, being God-like (having every positive property) is positive.

□Positive(G)

Grounded by Godel, Scott

A4 premise

Necessarily, a positive property is necessarily positive.

□∀F:prop. Positive(F) → □Positive(F)

Grounded by Godel, Scott

A5 premise

Necessarily, necessary existence is positive.

□Positive(NE)

Grounded by Godel, Scott

T1 deduction

A positive property is possibly exemplified.

∀F:prop. Positive(F) → ◇∃x. F(x)

From A1, A2

Proof
1□∀F:prop. Positive(λx. ¬F(x)) ↔ ¬Positive(F)premise A1
2□∀F:prop. ∀H:prop. Positive(F) ∧ □∀x. F(x) → H(x) → Positive(H)premise A2
3∀F:prop. Positive(λx. ¬F(x)) ↔ ¬Positive(F)box_e 1
4∀F:prop. ∀H:prop. Positive(F) ∧ □∀x. F(x) → H(x) → Positive(H)box_e 2
5Positive(Q)assume
6¬◇∃x. Q(x)assume
7□¬∃x. Q(x)md 6
8□□¬∃x. Q(x)reit 7
9¬∃x. Q(x)box_e 8
10∀x. ¬Q(x)qn 9
11c¬Q(c)forall_e 10
12Q(c)assume
13¬Q(c)reit 11
14Q(c) → ¬Q(c)imp_i 12–13
15∀x. Q(x) → ¬Q(x)forall_i 11–14
16□∀x. Q(x) → ¬Q(x)box_i 8–15
17Positive(Q) ∧ □∀x. Q(x) → ¬Q(x)and_i 5, 16
18∀H:prop. Positive(Q) ∧ □∀x. Q(x) → H(x) → Positive(H)forall_e 4
19Positive(Q) ∧ □∀x. Q(x) → ¬Q(x) → Positive(λx. ¬Q(x))forall_e 18
20Positive(λx. ¬Q(x))imp_e 19, 17
21Positive(λx. ¬Q(x)) ↔ ¬Positive(Q)forall_e 3
22¬Positive(Q)iff_e 21, 20
23⊥not_e 5, 22
24◇∃x. Q(x)raa 6–23
25Positive(Q) → ◇∃x. Q(x)imp_i 5–24
26∀F:prop. Positive(F) → ◇∃x. F(x)forall_i 5–25

Cor deduction

Possibly, a God-like being exists.

◇∃x. G(x)

From T1, A3

Proof
1∀F:prop. Positive(F) → ◇∃x. F(x)premise T1
2□Positive(G)premise A3
3Positive(G)box_e 2
4Positive(G) → ◇∃x. G(x)forall_e 1
5◇∃x. G(x)imp_e 4, 3

T2 deduction

Necessarily, being God-like is the essence of any God-like being.

□∀x. G(x) → Ess(G, x)

From A1, A4

Proof
1□∀F:prop. Positive(λx. ¬F(x)) ↔ ¬Positive(F)premise A1
2□∀F:prop. Positive(F) → □Positive(F)premise A4
3□□∀F:prop. Positive(λx. ¬F(x)) ↔ ¬Positive(F)reit 1
4□∀F:prop. Positive(F) → □Positive(F)reit 2
5∀F:prop. Positive(λx. ¬F(x)) ↔ ¬Positive(F)box_e 3
6∀F:prop. Positive(F) → □Positive(F)box_e 4
7G(a)assume
8∀F:prop. Positive(F) → F(a)def 7
9S(a)assume
10¬Positive(S)assume
11Positive(λx. ¬S(x)) ↔ ¬Positive(S)forall_e 5
12Positive(λx. ¬S(x))iff_e 11, 10
13Positive(λx. ¬S(x)) → ¬S(a)forall_e 8
14¬S(a)imp_e 13, 12
15⊥not_e 9, 14
16Positive(S)raa 10–15
17Positive(S) → □Positive(S)forall_e 6
18□Positive(S)imp_e 17, 16
19□□Positive(S)reit 18
20Positive(S)box_e 19
21G(b)assume
22∀F:prop. Positive(F) → F(b)def 21
23Positive(S) → S(b)forall_e 22
24S(b)imp_e 23, 20
25G(b) → S(b)imp_i 21–24
26∀y. G(y) → S(y)forall_i 21–25
27□∀y. G(y) → S(y)box_i 19–26
28S(a) → □∀y. G(y) → S(y)imp_i 9–27
29∀H:prop. H(a) → □∀y. G(y) → H(y)forall_i 9–28
30G(a) ∧ (∀H:prop. H(a) → □∀y. G(y) → H(y))and_i 7, 29
31Ess(G, a)def 30
32G(a) → Ess(G, a)imp_i 7–31
33∀x. G(x) → Ess(G, x)forall_i 7–32
34□∀x. G(x) → Ess(G, x)box_i 3–33

T3 conclusion

Necessarily, a God-like being exists.

□∃x. G(x)

From Cor, T2, A5

Proof
1◇∃x. G(x)premise Cor
2□∀x. G(x) → Ess(G, x)premise T2
3□Positive(NE)premise A5
4□□∀x. G(x) → Ess(G, x)reit 2
5□Positive(NE)reit 3
6∀x. G(x) → Ess(G, x)box_e 4
7Positive(NE)box_e 5
8∃x. G(x)assume
9gG(g)assume
10∀F:prop. Positive(F) → F(g)def 9
11Positive(NE) → NE(g)forall_e 10
12NE(g)imp_e 11, 7
13∀F:prop. Ess(F, g) → □∃y. F(y)def 12
14Ess(G, g) → □∃y. G(y)forall_e 13
15G(g) → Ess(G, g)forall_e 6
16Ess(G, g)imp_e 15, 9
17□∃y. G(y)imp_e 14, 16
18□∃y. G(y)exists_e 8, 9–17
19(∃x. G(x)) → □∃y. G(y)imp_i 8–18
20□((∃x. G(x)) → □∃y. G(y))box_i 4–19
21□∃x. G(x)assume
22□((∃x. G(x)) → □∃y. G(y))reit 20
23(∃x. G(x)) → □∃y. G(y)box_e 22
24□∃y. G(y)imp_e 23, 21
25◇□∃y. G(y)dia_e 1, 21–24
26¬□∃y. G(y)assume
27◇¬∃y. G(y)md 26
28□□∃y. G(y)assume
29◇¬∃y. G(y)reit 27
30¬□∃y. G(y)md 29
31⊥not_e 28, 30
32◇⊥dia_e 25, 28–31
33¬□¬⊥md 32
34⊥assume
35¬⊥not_i 34–34
36□¬⊥box_i 34–35
37⊥not_e 36, 33
38□∃y. G(y)raa 26–37

Objections and replies

O1 objection to A1 answered

Gödel never defines a positive property, so nothing guarantees the axioms describe anything coherent.

R1 reply to O1

Automated model finders have exhibited models of Scott's axioms (Benzmüller and Woltzenlogel Paleo, 2014), so they are consistent.

O2 objection to T3 answered

Sobel showed that the axioms entail modal collapse: every truth becomes a necessary truth.

R2 reply to O2

Emended axiom systems, such as Anderson's, block the collapse while keeping the conclusion.