Gödel s Proof of God s Existence
|
|
- Cathleen Lizbeth Garrison
- 5 years ago
- Views:
Transcription
1 Gödel s Proof of God s Existence Christoph Benzmüller and Bruno Woltzenlogel Paleo Square of Opposition Vatican, May 6, 2014 A gift to Priest Edvaldo in Piracicaba, Brazil Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 1
2 Contribution First time mechanization and automation of (variants of) a modern ontological argument (variants of) higher-order modal logic Work context/history: Proposal: exploit classical higher-order logic (HOL) as universal meta-logic cf. previous talks at UNILOG for object-level reasoning (in embedded non-classical logics) for meta-level reasoning (about embedded non-classical logics) Proof of concept: demonstrate practical relevance of the approach by an interesting and relevant application Experiments: systematic study of Gödel s argument Relation to Square of Opposition: should be easy to analyze variants of the Square within our approach Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 2
3 Introduction Challenge: No provers for Higher-order Quantified Modal Logic (QML) Our solution: Embedding in Higher-order Classical Logic (HOL) What we did: A: Pen and paper: detailed natural deduction proof B: Formalization: in classical higher-order logic (HOL) Automation: theorem provers LEO-II(E) and Satallax Consistency: model finder Nitpick (Nitrox) C: Step-by-step verification: proof assistant Coq D: Automation & verification: proof assistant Isabelle Did we get any new results? Yes let s discuss this later! Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 3
4 Introduction Austria - Die Presse - Wiener Zeitung - ORF -... Italy - Repubblica - Ilsussidario -... India - DNA India - Delhi Daily News - India Today -... Germany - Telepolis & Heise - Spiegel Online - FAZ - Die Welt - Berliner Morgenpost - Hamburger Abendpost -... US - ABC News -... International - Spiegel International - Yahoo Finance - United Press Intl Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 4
5 Introduction Austria - Die Presse - Wiener Zeitung - ORF -... Italy - Repubblica - Ilsussidario -... India - DNA India - Delhi Daily News - India Today -... Germany - Telepolis & Heise - Spiegel Online - FAZ - Die Welt - Berliner Morgenpost - Hamburger Abendpost -... US - ABC News -... International - Spiegel International - Yahoo Finance - United Press Intl Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 4
6 Introduction Do you really need a MacBook to obtain the results? No Did Apple send us some money? No Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 5
7 Introduction Do you really need a MacBook to obtain the results? No Did Apple send us some money? No Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 5
8 Introduction Rich history on ontological arguments (pros and cons) Anselm v. C. Gaunilo Th. Aquinas Descartes Spinoza Leibniz... Hume Kant... Hegel... Frege... Hartshorne Malcolm Lewis Gödel Plantinga... Anselm s notion of God: God is that, than which nothing greater can be conceived. Gödel s notion of God: A God-like being possesses all positive properties. To show by logical reasoning: (Necessarily) God exists. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 6
9 Introduction Rich history on ontological arguments (pros and cons) Anselm v. C. Gaunilo Th. Aquinas Descartes Spinoza Leibniz... Hume Kant... Hegel... Frege... Hartshorne Malcolm Lewis Gödel Plantinga... Anselm s notion of God: God is that, than which nothing greater can be conceived. Gödel s notion of God: A God-like being possesses all positive properties. To show by logical reasoning: (Necessarily) God exists. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 6
10 Introduction Different Interests in Ontological Arguments: Philosophical: Boundaries of Metaphysics & Epistemology We talk about a metaphysical concept (God), but we want to draw a conclusion for the real world. Theistic: Successful argument should convince atheists Ours: Can computers (theorem provers) be used to formalize the definitions, axioms and theorems?... to verify the arguments step-by-step?... to fully automate (sub-)arguments? Towards: Computer-assisted Theoretical Philosophy (cf. Leibniz dictum Calculemus!) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 7
11 Gödel s Manuscript: 1930 s, 1941, , 1970 Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 8
12 Scott s Version of Gödel s Axioms, Definitions and Theorems Axiom A1 Either a property or its negation is positive, but not both: φ[p( φ) P(φ)] Axiom A2 A property necessarily implied by a positive property is positive: φ ψ[(p(φ) x[φ(x) ψ(x)]) P(ψ)] Thm. T1 Positive properties are possibly exemplified: Def. D1 A God-like being possesses all positive properties: Axiom A3 The property of being God-like is positive: φ[p(φ) xφ(x)] G(x) φ[p(φ) φ(x)] P(G) Cor. C Possibly, God exists: xg(x) Axiom A4 Positive properties are necessarily positive: φ[p(φ) P(φ)] Def. D2 An essence of an individual is a property possessed by it and necessarily implying any of its properties: φ ess. x φ(x) ψ(ψ(x) y(φ(y) ψ(y))) Thm. T2 Being God-like is an essence of any God-like being: x[g(x) G ess. x] Def. D3 Necessary existence of an individ. is the necessary exemplification of all its essences: NE(x) φ[φ ess. x yφ(y)] Axiom A5 Necessary existence is a positive property: Thm. T3 Necessarily, God exists: P(NE) xg(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 9
13 Scott s Version of Gödel s Axioms, Definitions and Theorems Axiom A1 Either a property or its negation is positive, but not both: φ[p( φ) P(φ)] Axiom A2 A property necessarily implied by a positive property is positive: φ ψ[(p(φ) x[φ(x) ψ(x)]) P(ψ)] Thm. T1 Positive properties are possibly exemplified: Def. D1 A God-like being possesses all positive properties: Axiom A3 The property of being God-like is positive: φ[p(φ) xφ(x)] G(x) φ[p(φ) φ(x)] P(G) Cor. C Possibly, God exists: xg(x) Axiom A4 Positive properties are necessarily positive: φ[p(φ) P(φ)] Def. D2 An essence of an individual is a property possessed by it and necessarily implying any of its properties: φ ess. x φ(x) ψ(ψ(x) y(φ(y) ψ(y))) Thm. T2 Being God-like is an essence of any God-like being: x[g(x) G ess. x] Def. D3 Necessary existence of an individ. is the necessary exemplification of all its essences: NE(x) φ[φ ess. x yφ(y)] Axiom A5 Necessary existence is a positive property: Thm. T3 Necessarily, God exists: P(NE) xg(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 9
14 Scott s Version of Gödel s Axioms, Definitions and Theorems Axiom A1 Either a property or its negation is positive, but not both: φ[p( φ) P(φ)] Axiom A2 A property necessarily implied by a positive property is positive: φ ψ[(p(φ) x[φ(x) ψ(x)]) P(ψ)] Thm. T1 Positive properties are possibly exemplified: Def. D1 A God-like being possesses all positive properties: Axiom A3 The property of being God-like is positive: φ[p(φ) xφ(x)] G(x) φ[p(φ) φ(x)] P(G) Cor. C Possibly, God exists: xg(x) Axiom A4 Positive properties are necessarily positive: φ[p(φ) P(φ)] Def. D2 An essence of an individual is a property possessed by it and necessarily implying any of its properties: φ ess. x φ(x) ψ(ψ(x) y(φ(y) ψ(y))) Thm. T2 Being God-like is an essence of any God-like being: x[g(x) G ess. x] Def. D3 Necessary existence of an individ. is the necessary exemplification of all its essences: NE(x) φ[φ ess. x yφ(y)] Axiom A5 Necessary existence is a positive property: Thm. T3 Necessarily, God exists: P(NE) xg(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 9
15 Scott s Version of Gödel s Axioms, Definitions and Theorems Axiom A1 Either a property or its negation is positive, but not both: φ[p( φ) P(φ)] Axiom A2 A property necessarily implied by a positive property is positive: φ ψ[(p(φ) x[φ(x) ψ(x)]) P(ψ)] Thm. T1 Positive properties are possibly exemplified: Def. D1 A God-like being possesses all positive properties: Axiom A3 The property of being God-like is positive: φ[p(φ) xφ(x)] G(x) φ[p(φ) φ(x)] P(G) Cor. C Possibly, God exists: xg(x) Axiom A4 Positive properties are necessarily positive: φ[p(φ) P(φ)] Def. D2 An essence of an individual is a property possessed by it and necessarily implying any of its properties: φ ess. x φ(x) ψ(ψ(x) y(φ(y) ψ(y))) Thm. T2 Being God-like is an essence of any God-like being: x[g(x) G ess. x] Def. D3 Necessary existence of an individ. is the necessary exemplification of all its essences: NE(x) φ[φ ess. x yφ(y)] Axiom A5 Necessary existence is a positive property: Thm. T3 Necessarily, God exists: P(NE) xg(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 9
16 Remainder of this Talk Embedding of QML in HOL and Proof Automation (myself) Proof Overview (Bruno) Experiments and Results (Bruno) Conclusion and Outlook (Bruno) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 10
17 Embedding of QML in HOL and Proof Automation Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 11
18 Formalization in HOL Challenge: No provers for Higher-order Quantified Modal Logic (QML) Our solution: Embedding in Higher-order Classical Logic (HOL) Then use existing HOL theorem provers for reasoning in QML [BenzmüllerPaulson, Logica Universalis, 2013] Previous empirical findings: Embedding of First-order Modal Logic in HOL works well [BenzmüllerOttenRaths, ECAI, 2012] [BenzmüllerRaths, LPAR, 2013] Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 12
19 Formalization in HOL QML ϕ, ψ ::=... ϕ ϕ ψ ϕ ψ ϕ ϕ x ϕ x ϕ P ϕ Kripke style semantics (possible world semantics) HOL s, t ::= C x λxs s t s s t x t meanwhile very well understood Henkin semantics vs. standard semantics various theorem provers do exist interactive: Isabelle/HOL, HOL4, Hol Light, Coq/HOL, PVS,... automated: TPS, LEO-II, Satallax, Nitpick, Isabelle/HOL,... Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 13
20 Formalization in HOL QML ϕ, ψ ::=... ϕ ϕ ψ ϕ ψ ϕ ϕ x ϕ x ϕ P ϕ HOL s, t ::= C x λxs s t s s t x t QML in HOL: QML formulas ϕ are mapped to HOL predicates ϕ ι o = λϕ ι o λs ι ϕs = λϕ ι o λψ ι o λs ι (ϕs ψs) = λϕ ι o λψ ι o λs ι ( ϕs ψs) = λϕ ι o λs ι u ι ( rsu ϕu) = λϕ ι o λs ι u ι (rsu ϕu) = λh µ (ι o) λs ι d µ hds = λh µ (ι o) λs ι d µ hds = λh (µ (ι o)) (ι o) λs ι d µ Hds Ax valid = λϕ ι o w ι ϕw The equations in Ax are given as axioms to the HOL provers! (Remark: Note that we are here dealing with constant domain quantification) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 14
21 Formalization in HOL QML ϕ, ψ ::=... ϕ ϕ ψ ϕ ψ ϕ ϕ x ϕ x ϕ P ϕ HOL s, t ::= C x λxs s t s s t x t QML in HOL: QML formulas ϕ are mapped to HOL predicates ϕ ι o = λϕ ι o λs ι ϕs = λϕ ι o λψ ι o λs ι (ϕs ψs) = λϕ ι o λψ ι o λs ι ( ϕs ψs) = λϕ ι o λs ι u ι ( rsu ϕu) = λϕ ι o λs ι u ι (rsu ϕu) = λh µ (ι o) λs ι d µ hds = λh µ (ι o) λs ι d µ hds = λh (µ (ι o)) (ι o) λs ι d µ Hds Ax valid = λϕ ι o w ι ϕw The equations in Ax are given as axioms to the HOL provers! (Remark: Note that we are here dealing with constant domain quantification) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 14
22 Formalization in HOL QML ϕ, ψ ::=... ϕ ϕ ψ ϕ ψ ϕ ϕ x ϕ x ϕ P ϕ HOL s, t ::= C x λxs s t s s t x t QML in HOL: QML formulas ϕ are mapped to HOL predicates ϕ ι o = λϕ ι o λs ι ϕs = λϕ ι o λψ ι o λs ι (ϕs ψs) = λϕ ι o λψ ι o λs ι ( ϕs ψs) = λϕ ι o λs ι u ι ( rsu ϕu) = λϕ ι o λs ι u ι (rsu ϕu) = λh µ (ι o) λs ι d µ hds = λh µ (ι o) λs ι d µ hds = λh (µ (ι o)) (ι o) λs ι d µ Hds Ax valid = λϕ ι o w ι ϕw The equations in Ax are given as axioms to the HOL provers! (Remark: Note that we are here dealing with constant domain quantification) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 14
23 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
24 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
25 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
26 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
27 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
28 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
29 Formalization in HOL Example: QML formula xg(x) QML formula in HOL valid ( xg(x)) ι o expansion, βη-conversion w ι ( xg(x)) ι o w expansion, βη-conversion w ι u ι (rwu ( xg(x)) ι o u) expansion, βη-conversion w ι u ι (rwu xgxu) What are we doing? In order to prove that ϕ is valid in QML, > we instead prove that valid ϕ ι o can be derived from Ax in HOL. This can be done with interactive or automated HOL theorem provers. Soundness and Completeness: wrt. Henkin semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 15
30 Automated Theorem Provers and Model Finders for HOL Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 16
31 Proof Overview Experiments and Results Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 17
32 Gödel s Manuscript: 1930 s, 1941, , 1970 Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 18
33 Proof Overview T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 19
34 Proof Overview C1: z.g(z) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 20
35 Proof Overview C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 21
36 Proof Overview C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 22
37 Proof Overview L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 23
38 Proof Overview S5 ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 24
39 Proof Overview S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 25
40 Proof Overview L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 26
41 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 27
42 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] T2: y.[g(y) G ess. y] P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 28
43 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] T2: y.[g(y) G ess. y] A5 P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 29
44 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] T2: y.[g(y) G ess. y] A5 P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 30
45 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D2: ϕ ess. x ϕ(x) ψ.(ψ(x) x.(ϕ(x) ψ(x))) D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] A1b ϕ.[ P(ϕ) P( ϕ)] T2: y.[g(y) G ess. y] A4 ϕ.[p(ϕ) P(ϕ)] A5 P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 31
46 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D2: ϕ ess. x ϕ(x) ψ.(ψ(x) x.(ϕ(x) ψ(x))) D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] A1b ϕ.[ P(ϕ) P( ϕ)] C1: z.g(z) T2: y.[g(y) G ess. y] A4 ϕ.[p(ϕ) P(ϕ)] A5 P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 32
47 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D2: ϕ ess. x ϕ(x) ψ.(ψ(x) x.(ϕ(x) ψ(x))) D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] A3 P(G) C1: z.g(z) T1: ϕ.[p(ϕ) x.ϕ(x)] A1b ϕ.[ P(ϕ) P( ϕ)] T2: y.[g(y) G ess. y] A4 ϕ.[p(ϕ) P(ϕ)] A5 P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 33
48 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D2: ϕ ess. x ϕ(x) ψ.(ψ(x) x.(ϕ(x) ψ(x))) D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] A3 P(G) A2 ϕ. ψ.[(p(ϕ) x.[ϕ(x) ψ(x)]) P(ψ)] C1: z.g(z) T1: ϕ.[p(ϕ) x.ϕ(x)] A1a ϕ.[p( ϕ) P(ϕ)] A1b ϕ.[ P(ϕ) P( ϕ)] T2: y.[g(y) G ess. y] A4 ϕ.[p(ϕ) P(ϕ)] A5 P(E) L1: z.g(z) x.g(x) S5 z.g(z) x.g(x) ξ.[ ξ ξ] L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 34
49 Proof Overview D1: G(x) ϕ.[p(ϕ) ϕ(x)] D2: ϕ ess. x ϕ(x) ψ.(ψ(x) x.(ϕ(x) ψ(x))) D3: E(x) ϕ.[ϕ ess. x y.ϕ(y)] A3 P(G) A2 ϕ. ψ.[(p(ϕ) x.[ϕ(x) ψ(x)]) P(ψ)] C1: z.g(z) T1: ϕ.[p(ϕ) x.ϕ(x)] A1a ϕ.[p( ϕ) P(ϕ)] A1b ϕ.[ P(ϕ) P( ϕ)] T2: y.[g(y) G ess. y] A4 ϕ.[p(ϕ) P(ϕ)] L1: z.g(z) x.g(x) z.g(z) x.g(x) A5 P(E) L2: z.g(z) x.g(x) C1: z.g(z) L2: z.g(z) x.g(x) T3: x.g(x) S5 ξ.[ ξ ξ] Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 35
50 Natural Deduction Calculus Ạ... A B C C Ḅ... C E A B A B I A n. B A B n I A A B I 1 A B A E 1 B A B I B A B I 2 A B B E2 A A B B E A[α] x.a[x] I x.a[x] A[t] E A[t] x.a[x] I x.a[x] A[β] E A A A A E Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 36
51 Natural Deduction Calculus Rules for Modalities. α : A A I t : A Ạ... E. t : A A I β : A Ạ... E A A Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 37
52 Natural Deduction Proofs T1 and C1 A2 ϕ. ψ.[(p(ϕ) x.[ϕ(x) ψ(x)]) P(ψ)] ψ.[(p(ρ) x.[ρ(x) ψ(x)]) P(ψ)] (P(ρ) x.[ρ(x) ρ(x)]) P( ρ) (P(ρ) x.[ ρ(x)]) P( ρ) E E (P(ρ) x.[ ρ(x)]) P(ρ) P(ρ) x.ρ(x) T1: ϕ.[p(ϕ) x.ϕ(x)] A1a ϕ.[p( ϕ) P(ϕ)] I P( ρ) P(ρ) E A3 P(G) T1 ϕ.[p(ϕ) x.ϕ(x)] P(G) x.g(x) x.g(x) E E Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 38
53 Natural Deduction Proofs T2 (Partial) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 39
54 Implementations and Experiments Formal encodings (in HOL) of: modal logic axioms axioms, definitions, and theorems in Scott s proof script Experiments using automated provers LEO-II, Satallax, AgsyHOL Interactive proofs using proof assistants Isabelle and Coq Source files available at: Demos on request! Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 40
55 Implementations and Experiments Formal encodings (in HOL) of: modal logic axioms axioms, definitions, and theorems in Scott s proof script Experiments using automated provers LEO-II, Satallax, AgsyHOL Interactive proofs using proof assistants Isabelle and Coq Source files available at: Demos on request! Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 40
56 Results Axioms and definitions are consistent. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
57 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
58 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. Adresses criticisms: modal logic S5 is too strong P.[ P P] If something is possibly necessary, then it is necessary. S5 usually considered adequate (But KB is sufficient! shown by HOL ATPs) P.[P P] If something is the case, then it is necessarily possible. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
59 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. HOL-ATPs prove T1, C, and T2 from axioms quickly; succeed in proving T3 from axioms, C and T2; but fail in proving T3 from axioms alone. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
60 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. HOL-ATPs prove T1, C, and T2 from axioms quickly; succeed in proving T3 from axioms, C and T2; but fail in proving T3 from axioms alone. Gödel s original axioms and definitions, omitting conjunct φ(x) in the definition of essence, seem inconsistent. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
61 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. HOL-ATPs prove T1, C, and T2 from axioms quickly; succeed in proving T3 from axioms, C and T2; but fail in proving T3 from axioms alone. Gödel s original axioms and definitions, omitting conjunct φ(x) in the definition of essence, seem inconsistent. x.g(x) can be proved without first proving x.g(x). Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
62 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. HOL-ATPs prove T1, C, and T2 from axioms quickly; succeed in proving T3 from axioms, C and T2; but fail in proving T3 from axioms alone. Gödel s original axioms and definitions, omitting conjunct φ(x) in the definition of essence, seem inconsistent. x.g(x) can be proved without first proving x.g(x). Equality is not necessary to prove T1. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
63 Results Axioms and definitions are consistent. Logic K is sufficient for proving T1, C and T2. Logic KB is sufficient for proving the final theorem T3. HOL-ATPs prove T1, C, and T2 from axioms quickly; succeed in proving T3 from axioms, C and T2; but fail in proving T3 from axioms alone. Gödel s original axioms and definitions, omitting conjunct φ(x) in the definition of essence, seem inconsistent. x.g(x) can be proved without first proving x.g(x). Equality is not necessary to prove T1. A2 may be used only once to prove T1. Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 41
64 Results Gödel s axioms imply the modal collapse: φ.(φ φ) Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 42
65 Results Gödel s axioms imply the modal collapse: φ.(φ φ) Fundamental criticism against Gödel s argument. Everything that is the case is so necessarily. Follows from T2, T3 and D2 (as shown by HOL ATPs). There are no contingent truths. Everything is determined. There is no free will. Many proposed solutions: Anderson, Fitting, Hájek,... Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 42
66 Results Gödel s axioms imply the modal collapse: φ.(φ φ) Fundamental criticism against Gödel s argument. Everything that is the case is so necessarily. Follows from T2, T3 and D2 (as shown by HOL ATPs). There are no contingent truths. Everything is determined. There is no free will. Many proposed solutions: Anderson, Fitting, Hájek,... Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 42
67 Results God is flawless: x.g(x) ( ϕ. P(ϕ) ϕ(x)). Monotheism: x. y.g(x) G(y) x = y. All results hold for both - constant domain semantics - varying domain semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 43
68 Results God is flawless: x.g(x) ( ϕ. P(ϕ) ϕ(x)). Monotheism: x. y.g(x) G(y) x = y. All results hold for both - constant domain semantics - varying domain semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 43
69 Results God is flawless: x.g(x) ( ϕ. P(ϕ) ϕ(x)). Monotheism: x. y.g(x) G(y) x = y. All results hold for both - constant domain semantics - varying domain semantics Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 43
70 Conclusions Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 44
71 Conclusion Achievements: Infra-structure for automated higher-order modal reasoning Verification of Gödel s ontological argument with HOL provers experiments with different parameters Novel results and insights Major step towards Computer-assisted Theoretical Philosophy see also Ed Zalta s Computational Metaphysics project at Stanford University see also John Rushby s recent verification of Anselm s proof in PVS remember Leibniz dictum Calculemus! Interesting bridge between CS, Philosophy and Theology Ongoing and future work Formalize and verify literature on ontological arguments... in particular the criticisms and proposed improvements Own contributions supported by theorem provers Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 45
72 Conclusion Achievements: Infra-structure for automated higher-order modal reasoning Verification of Gödel s ontological argument with HOL provers experiments with different parameters Novel results and insights Major step towards Computer-assisted Theoretical Philosophy see also Ed Zalta s Computational Metaphysics project at Stanford University see also John Rushby s recent verification of Anselm s proof in PVS remember Leibniz dictum Calculemus! Interesting bridge between CS, Philosophy and Theology Ongoing and future work Formalize and verify literature on ontological arguments... in particular the criticisms and proposed improvements Own contributions supported by theorem provers Christoph Benzmüller and Bruno Woltzenlogel Paleo Gödel s Proof of God s Existence 45
On a (Quite) Universal Theorem Proving Approach and its Application to Metaphycis
On a (Quite) Universal Theorem Proving Approach and its Application to Metaphycis Christoph Benzmüller 1, FU Berlin jww: B. Woltzenlogel Paleo, L. Paulson, C. Brown, G. Sutcliffe and many others! Tableaux
More informationA Success Story of Higher-Order (Automated) Theorem Proving in Computational Metaphysics
A Success Story of Higher-Order (Automated) Theorem Proving in Computational Metaphysics Christoph Benzmüller 1, Stanford (CSLI/Cordula Hall) & FU Berlin jww: B. Woltzenlogel Paleo (& L. Paulson, C. Brown,
More informationTemporal Logic - Soundness and Completeness of L
Temporal Logic - Soundness and Completeness of L CS402, Spring 2018 Soundness Theorem 1 (14.12) Let A be an LTL formula. If L A, then A. Proof. We need to prove the axioms and two inference rules to be
More informationVariants of Gödel's Ontological Proof in a Natural Deduction Calculus
https://helda.helsinki.fi Variants of Gödel's Ontological in a Natural Deduction Calculus Kanckos, Annika 07 Kanckos, A & Woltzenlogel Paleo, B 07, ' Variants of Gödel's Ontological in a Natural Deduction
More informationThe World s Most Widely Applicable Modal Logic Theorem Prover and its Associated Infrastructure
The World s Most Widely Applicable Modal Logic Theorem Prover and its Associated Infrastructure Alexander Steen Freie Universität Berlin RuleML Webinar September 29th 0 jww C. Benzmüller, T. Gleißner Talk
More informationThe Inconsistency in Gödel s Ontological Argument: A Success Story for AI in Metaphysics
The Inconsistency in Gödel s Ontological Argument: A Success Story for AI in Metaphysics Christoph Benzmüller Freie Universität Berlin & Stanford University c.benzmueller@gmail.com Bruno Woltzenlogel Paleo
More informationAgent-Based HOL Reasoning 1
Agent-Based HOL Reasoning 1 Alexander Steen Max Wisniewski Christoph Benzmüller Freie Universität Berlin 5th International Congress on Mathematical Software (ICMS 2016) 1 This work has been supported by
More informationUtilizing Church s Type Theory as a Universal Logic 1
Utilizing Church s Type Theory as a Universal Logic 1 Christoph Benzmüller Freie Universität Berlin Presentation at TU Wien, October 31, 2012 1 This work has been funded by the DFG under grants BE 2501/6-1,
More informationTutorial on Reasoning in Expressive Non-Classical Logics with Isabelle/HOL
Tutorial on Reasoning in Expressive Non-Classical Logics with Isabelle/HOL Alexander Steen 1, Max Wisniewski 1, and Christoph Benzmüller 1 Freie Universität Berlin, Berlin, Germany a.steen m.wisniewski
More informationTypes, Tableaus and Gödel s God in Isabelle/HOL
Types, Tableaus and Gödel s God in Isabelle/HOL David Fuenmayor 1 and Christoph Benzmüller 2,1 1 Freie Universität Berlin, Germany 2 University of Luxembourg, Luxembourg August 16, 2018 Abstract A computer-formalisation
More informationCombining and Automating Classical and Non-Classical Logics in Classical Higher-Order Logics
Annals of Mathematics and Artificial Intelligence (pre-final version) The final publication is available at www.springerlink.com Combining and Automating Classical and Non-Classical Logics in Classical
More informationAnselm s God in Isabelle/HOL
Anselm s God in Isabelle/HOL Ben Blumson September 12, 2017 Contents 1 Introduction 1 2 Free Logic 2 3 Definite Descriptions 3 4 Anselm s Argument 4 5 The Prover9 Argument 6 6 Soundness 7 7 Conclusion
More information2 DANIEL KIRCHNER, CHRISTOPH BENZMÜLLER, AND EDWARD N. ZALTA
MECHANIZING PRINCIPIA LOGICO-METAPHYSICA IN FUNCTIONAL TYPE THEORY arxiv:1711.06542v1 [cs.lo] 16 Nov 2017 DANIEL KIRCHNER, CHRISTOPH BENZMÜLLER, AND EDWARD N. ZALTA Abstract. Principia Logico-Metaphysica
More informationSystematic Verification of the Modal Logic Cube in Isabelle/HOL
Systematic Verification of the Modal Logic Cube in Isabelle/HOL Christoph Benzmüller Maximilian Claus Dep. of Mathematics and Computer Science, Freie Universität Berlin, Germany c.benzmueller m.claus@fu-berlin.de
More informationCompleteness Theorems and λ-calculus
Thierry Coquand Apr. 23, 2005 Content of the talk We explain how to discover some variants of Hindley s completeness theorem (1983) via analysing proof theory of impredicative systems We present some remarks
More informationPossible Worlds, The Lewis Principle, and the Myth of a Large Ontology
Possible Worlds, The Lewis Principle, and the Myth of a Large Ontology Edward N. Zalta CSLI, Stanford University zalta@stanford.edu http://mally.stanford.edu/zalta.html and Christopher Menzel Philosophy,
More informationComputer-Checked Meta-Logic
1 PART Seminar 25 February 2015 Computer-Checked Meta-Logic Jørgen Villadsen jovi@dtu.dk Abstract Over the past decades there have been several impressive results in computer-checked meta-logic, including
More informationAutomating Emendations of the Ontological Argument in Intensional Higher-Order Modal Logic
Automating Emendations of the Ontological Argument in Intensional Higher-Order Modal Logic David Fuenmayor 1 and Christoph Benzmüller 2,1 1 Freie Universität Berlin, Germany 2 University of Luxembourg,
More informationDeveloping Modal Tableaux and Resolution Methods via First-Order Resolution
Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationNICTA Advanced Course. Theorem Proving Principles, Techniques, Applications. Gerwin Klein Formal Methods
NICTA Advanced Course Theorem Proving Principles, Techniques, Applications Gerwin Klein Formal Methods 1 ORGANISATORIALS When Mon 14:00 15:30 Wed 10:30 12:00 7 weeks ends Mon, 20.9.2004 Exceptions Mon
More informationDEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION
DEFINITE DESCRIPTIONS: LANGUAGE, LOGIC, AND ELIMINATION NORBERT GRATZL University of Salzburg Abstract Definite descriptions are in the focus of philosophical discussion at least since Russell s famous
More informationNon-classical Logics: Theory, Applications and Tools
Non-classical Logics: Theory, Applications and Tools Agata Ciabattoni Vienna University of Technology (TUV) Joint work with (TUV): M. Baaz, P. Baldi, B. Lellmann, R. Ramanayake,... N. Galatos (US), G.
More informationA Logically Coherent Ante Rem Structuralism
A Logically Coherent Ante Rem Structuralism Edward N. Zalta CSLI, Stanford University zalta@stanford.edu http://mally.stanford.edu/zalta.html and Uri Nodelman CSLI, Stanford University nodelman@stanford.edu
More informationThe Curry-Howard Isomorphism
The Curry-Howard Isomorphism Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) The Curry-Howard Isomorphism MFES 2008/09
More informationPropositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST
Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Review Goal of logic To check whether given a formula
More informationMechanized Analysis Of a Formalization of Anselm s Ontological Argument by Eder and Ramharter
CSL Technical Note. Mechanized Analysis Of a Formalization of Anselm s Ontological Argument by Eder and Ramharter John Rushby Computer Science Laboratory SRI International, Menlo Park CA USA February 11,
More informationADyadicDeonticLogicinHOL
Christoph Benzmüller University of Luxembourg, Luxembourg, and Freie Universität Berlin, Germany c.benzmueller@gmail.com Ali Farjami University of Luxembourg, Luxembourg farjami110@gmail.com Xavier Parent
More informationHigher-Order Aspects and Context in SUMO
Higher-Order Aspects and Context in SUMO Christoph Benzmüller 1, Freie Universität Berlin, Germany Adam Pease Articulate Software, Angwin, CA, USA Abstract This article addresses the automation of higher-order
More informationHigher-Order Aspects and Context in SUMO
Higher-Order Aspects and Context in SUMO Christoph Benzmüller 1, Freie Universität Berlin, Germany Adam Pease Rearden Commerce, Foster City, CA, USA Abstract This article addresses the automation of higher-order
More informationMathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy
Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No
More informationWrite your own Theorem Prover
Write your own Theorem Prover Phil Scott 27 October 2016 Phil Scott Write your own Theorem Prover 27 October 2016 1 / 31 Introduction We ll work through a toy LCF style theorem prover for classical propositional
More informationThe problem of defining essence
The problem of defining essence including an introduction of Zalta s abstract object theory This presentation undertakes to investigate the problem of defining essence. The prevailing definition was challenged
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2008/09
More informationGS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen Anthony Hall
GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen www.cs.ucl.ac.uk/staff/j.bowen/gs03 Anthony Hall GS03 W1 L3 Predicate Logic 12 January 2007 1 Overview The need for extra structure
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationQuantifiers and Functions in Intuitionistic Logic
Quantifiers and Functions in Intuitionistic Logic Association for Symbolic Logic Spring Meeting Seattle, April 12, 2017 Rosalie Iemhoff Utrecht University, the Netherlands 1 / 37 Quantifiers are complicated.
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationAutomating Leibniz s Theory of Concepts
Automating Leibniz s Theory of Concepts Jesse Alama Paul E. Oppenheimer Edward N. Zalta Center for the Study of Language and Information Stanford University alama@logic.at, {paul.oppenheimer,zalta}@stanford.edu
More informationChurch and Curry: Combining Intrinsic and Extrinsic Typing
Church and Curry: Combining Intrinsic and Extrinsic Typing Frank Pfenning Dedicated to Peter Andrews on the occasion of his retirement Department of Computer Science Carnegie Mellon University April 5,
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationMechanically Assisted Examination of Begging the Question in Anselm s Ontological Argument
Mechanically Assisted Examination of Begging the Question in Anselm s Ontological Argument John Rushby Computer Science Laboratory SRI International Menlo Park, California, USA John Rushby, SR I Examining
More informationQuantified Modal Logic and the Ontology of Physical Objects
Scuola Normale Superiore Classe di Lettere e Filosofia Anno Accademico 2004-05 Tesi di Perfezionamento Quantified Modal Logic and the Ontology of Physical Objects CANDIDATO: Dott. F. Belardinelli RELATORE:
More informationLogic: First Order Logic
Logic: First Order Logic Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationSeptember 13, Cemela Summer School. Mathematics as language. Fact or Metaphor? John T. Baldwin. Framing the issues. structures and languages
September 13, 2008 A Language of / for mathematics..., I interpret that mathematics is a language in a particular way, namely as a metaphor. David Pimm, Speaking Mathematically Alternatively Scientists,
More information2 Overview of Object Theory and Two Applications. 1 Introduction
Automating Leibniz s Theory of Concepts 2 Automating Leibniz s Theory of Concepts Jesse Alama Vienna University of Technology alama@logic.at and Paul E. Oppenheimer Stanford University paul.oppenheimer@stanford.edu
More informationBeyond First-Order Logic
Beyond First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) Beyond First-Order Logic MFES 2008/09 1 / 37 FOL
More informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2009/2010 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2009/10
More informationPropositional Calculus - Hilbert system H Moonzoo Kim CS Dept. KAIST
Propositional Calculus - Hilbert system H Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr CS402 1 Review Goal of logic To check whether given a formula Á is valid To prove a given formula Á ` Á Syntactic
More informationMeaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have
INTENSIONAL AND MODAL LOGIC Meaning and Reference Why do we consider extensions to the standard logical language(s)? Requirements of knowledge representation / domain modelling Intensional expressions:
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationPropositional Calculus - Soundness & Completeness of H
Propositional Calculus - Soundness & Completeness of H Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Review Goal of logic To check whether given a formula Á is valid To prove a given formula Á `
More informationPropositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.
January 22, 2013 Modal logic is, among other things, the logic of possibility and necessity. Its history goes back at least to Aristotle s discussion of modal syllogisms in the Prior Analytics. But modern
More informationAutomating Access Control Logics in Simple Type Theory with LEO-II
Automating Access Control Logics in Simple Type Theory with LEO-II Christoph Benzmüller Abstract Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete
More informationHigher-Order Automated Theorem Provers
Higher-Order Automated Theorem Provers Christoph Benzmüller Department of Mathematics and Computer Science Freie Universität Berlin, Germany c.benzmueller@fu-berlin.de 1 Introduction The automation of
More informationCompleteness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:
Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC
More informationFrom Syllogism to Common Sense
From Syllogism to Common Sense Mehul Bhatt Oliver Kutz Thomas Schneider Department of Computer Science & Research Center on Spatial Cognition (SFB/TR 8) University of Bremen Normal Modal Logic K r i p
More informationRestricted truth predicates in first-order logic
Restricted truth predicates in first-order logic Thomas Bolander 1 Introduction It is well-known that there exist consistent first-order theories that become inconsistent when we add Tarski s schema T.
More informationValidating QBF Invalidity in HOL4
Interactive Theorem Proving (ITP) 14 July, 2010 Quantified Boolean Formulae Quantified Boolean Formulae Motivation System Overview Related Work QBF = propositional logic + quantifiers over Boolean variables
More informationQUANTIFICATION AND INTERACTION
QUANTIFICATION AND INTERACTION 1 Vito Michele Abrusci (Università di Roma tre) Christian Retoré (Université de Bordeaux, INRIA, LaBRI-CNRS) CONTENTS Standard quantification (history, linguistic data) Models,
More informationLCF + Logical Frameworks = Isabelle (25 Years Later)
LCF + Logical Frameworks = Isabelle (25 Years Later) Lawrence C. Paulson, Computer Laboratory, University of Cambridge 16 April 2012 Milner Symposium, Edinburgh 1979 Edinburgh LCF: From the Preface the
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationLecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem
Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Valentine Kabanets October 27, 2016 1 Gödel s Second Incompleteness Theorem 1.1 Consistency We say that a proof system P is consistent
More informationTR : Possible World Semantics for First Order LP
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2011 TR-2011010: Possible World Semantics for First Order LP Melvin Fitting Follow this and additional
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationFrege: Logical objects by abstraction and their criteria of identity. Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy)
1 Frege: Logical objects by abstraction and their criteria of identity Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy) Abstraction à la Frege A schema for a Fregean abstraction
More informationthe logic of provability
A bird s eye view on the logic of provability Rineke Verbrugge, Institute of Artificial Intelligence, University of Groningen Annual Meet on Logic and its Applications, Calcutta Logic Circle, Kolkata,
More informationAutomated Reasoning for the Dialetheic Logic RM3
Proceedings of the Thirtieth International Florida Artificial Intelligence Research Society Conference Automated Reasoning for the Dialetheic Logic RM3 Francis Jeffry Pelletier Department Philosophy University
More informationPhilosophy 244: #14 Existence and Identity
Philosophy 244: #14 Existence and Identity Existence Predicates The problem we ve been having is that (a) we want to allow models that invalidate the CBF ( xα x α), (b) these will have to be models in
More informationLecture 15 The Second Incompleteness Theorem. Michael Beeson
Lecture 15 The Second Incompleteness Theorem Michael Beeson The Second Incompleteness Theorem Let Con PA be the formula k Prf(k, 0 = 1 ) Then Con PA expresses the consistency of PA. The second incompleteness
More informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationUniform Schemata for Proof Rules
Uniform Schemata for Proof Rules Ulrich Berger and Tie Hou Department of omputer Science, Swansea University, UK {u.berger,cshou}@swansea.ac.uk Abstract. Motivated by the desire to facilitate the implementation
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationMetaphysics of Modality
Metaphysics of Modality Lecture 3: Abstract Modal Realism/Actualism Daisy Dixon dd426 1. Introduction Possible worlds are abstract and actual 1. Introduction Possible worlds are abstract and actual There
More informationGödel s Incompleteness Theorems
Gödel s Incompleteness Theorems Reinhard Kahle CMA & Departamento de Matemática FCT, Universidade Nova de Lisboa Hilbert Bernays Summer School 2015 Göttingen Partially funded by FCT project PTDC/MHC-FIL/5363/2012
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More informationSystems of modal logic
499 Modal and Temporal Logic Systems of modal logic Marek Sergot Department of Computing Imperial College, London utumn 2008 Further reading: B.F. Chellas, Modal logic: an introduction. Cambridge University
More information02 The Axiomatic Method
CAS 734 Winter 2005 02 The Axiomatic Method Instructor: W. M. Farmer Revised: 11 January 2005 1 What is Mathematics? The essence of mathematics is a process consisting of three intertwined activities:
More informationOutline. Overview. Syntax Semantics. Introduction Hilbert Calculus Natural Deduction. 1 Introduction. 2 Language: Syntax and Semantics
Introduction Arnd Poetzsch-Heffter Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern Sommersemester 2010 Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich
More informationDraft of February 2019 please do not cite without permission. A new modal liar 1 T. Parent
Draft of February 2019 please do not cite without permission 1. Introduction A new modal liar 1 T. Parent Standardly, necessarily is treated in modal logic as an operator on propositions (much like ~ ).
More informationAdvances in the theory of fixed points in many-valued logics
Advances in the theory of fixed points in many-valued logics Department of Mathematics and Computer Science. Università degli Studi di Salerno www.logica.dmi.unisa.it/lucaspada 8 th International Tbilisi
More informationAutomated Reasoning Lecture 5: First-Order Logic
Automated Reasoning Lecture 5: First-Order Logic Jacques Fleuriot jdf@inf.ac.uk Recap Over the last three lectures, we have looked at: Propositional logic, semantics and proof systems Doing propositional
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationOn fixed points, diagonalization, and self-reference
Indiana University - Purdue University Fort Wayne Opus: Research & Creativity at IPFW Philosophy Faculty Presentations Department of Philosophy Fall 9-12-2016 On fixed points, diagonalization, and self-reference
More informationA Structuralist Account of Logic
Croatian Journal of Philosophy Vol. VIII, No. 23, 2008 Majda Trobok, Department of Philosophy University of Rijeka A Structuralist Account of Logic The lynch-pin of the structuralist account of logic endorsed
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationCode Generation for a Simple First-Order Prover
Code Generation for a Simple First-Order Prover Jørgen Villadsen, Anders Schlichtkrull, and Andreas Halkjær From DTU Compute, Technical University of Denmark, 2800 Kongens Lyngby, Denmark Abstract. We
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More information- Introduction to propositional, predicate and higher order logics
Lecture 1: Deductive Verification of Reactive Systems - Introduction to propositional, predicate and higher order logics - Deductive Invariance Proofs Cristina Seceleanu MRTC, MdH E-mail: cristina.seceleanu@mdh.se
More informationBeth model with many types of functionals
Beth model with many types of functionals Farida Kachapova Auckland University of Technology New Zealand farida.kachapova@aut.ac.nz September 2013 Farida Kachapova (AUT) Beth model with functionals September
More informationThe roots of computability theory. September 5, 2016
The roots of computability theory September 5, 2016 Algorithms An algorithm for a task or problem is a procedure that, if followed step by step and without any ingenuity, leads to the desired result/solution.
More informationNon-normal Worlds. Daniel Bonevac. February 5, 2012
Non-normal Worlds Daniel Bonevac February 5, 2012 Lewis and Langford (1932) devised five basic systems of modal logic, S1 - S5. S4 and S5, as we have seen, are normal systems, equivalent to K ρτ and K
More informationPredicate Calculus - Semantic Tableau (2/2) Moonzoo Kim CS Division of EECS Dept. KAIST
Predicate Calculus - Semantic Tableau (2/2) Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Formal construction is explained in two steps
More informationFoundations of Logic Programming
Foundations of Logic Programming Deductive Logic e.g. of use: Gypsy specifications and proofs About deductive logic (Gödel, 1931) Interesting systems (with a finite number of axioms) are necessarily either:
More information