Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- A Machine-Assisted Proof of Gödel's... by Lawrence Paulson 524 views
- Introduction to spartakus and how i... by Samikshan Bairagya 677 views
- Creacion de un cartridge para Opens... by Alex Oviedo Solis 328 views
- Curious case-of-fedora-freshmen by Sarup Banskota 2409 views
- Rails vs Web2py by jonromero 7837 views
- G-Shock 3D Branding Exercise by Alejandro Rios Peña 620 views

2,794 views

2,693 views

2,693 views

Published on

Video can be viewed at:

http://wh-stream.stanford.edu/MediaX/CarlHewittEdit.mp4

No Downloads

Total views

2,794

On SlideShare

0

From Embeds

0

Number of Embeds

1

Shares

0

Downloads

0

Comments

1

Likes

2

No embeds

No notes for slide

- 1. WittgensteinvsGödelonFoundations of Logic<br />Carl Hewitt<br />
- 2. Abstract<br />This talk (in four parts) explains how some of the writings of Ludwig Wittgenstein can be interpreted as precursors of important developments in the foundations of mathematical logic for information systems applications. These Wittgenstein writings stand in almost exact opposition to the views of Kurt Gödel.<br /> First part: the current state of foundations of mathematical logic for information systems applications is overviewed with regard to issues of expressiblity, incompleteness, and inconsistency tolerance.<br /> Second part: The above developments have precursors in the following writings of Wittgenstein: *There can’t in any fundamental sense be such a thing as meta-mathematics. . . . Thus, it isn’t enough to say that p is provable, what we must say is: provable according to a particular system.True in Russell’s system” means, as we have said, proved in Russell's system; and “false in Russell's system” means that the opposite has been proved in Russell's system.Have said-with pride in a mathematical discovery [e.g., inconsistency of Russell’s system because incompleteness is self-proved]: “Look, this is how we produce a contradiction.”Indeed, even at this stage, I predict a time when there will be mathematical investigations of calculi containing contradictions, and people will actually be proud of having emancipated themselves from consistency.<br /> Third part:the above views are contrasted with the almost opposite ones of Gödel.The situation between Gödel and Wittgenstein can be summarized as follows: <br />Gödel<br />Mathematics is based on objective truth.<br />Roundtripping proves incompleteness but (hopefully) not inconsistency.<br />Theories should be proved consistent. <br />Wittgenstein<br />Mathematics is based on communities of practice.<br />Self-proof of incompleteness leads to inconsistency.<br />Theories should use inconsistency tolerant reasoning.<br /> Fourth part:How do the above provide framework and guidance for the further development of logic for information systems applications?<br /> *The (posthumously edited) writings of Wittgenstein are idiosyncratic and fragmentary. Interpretations in this talk are directed to putting them in their best possible light as precursors. <br />
- 3. Further reading<br />Common sense for concurrency and inconsistency tolerance using Direct Logic™ ArXiv:0812.4852<br />
- 4. Overview<br />State of the art<br />Cherry-picking Wittgenstein<br />Gödel on Wittgenstein<br />Inventing the future<br />
- 5. Pervasive Inconsistency<br />“find bugs faster than developers can fix them and each fix leads to another bug”--Cusumano & Selby 1995<br />
- 6. Wittgenstein 1930<br />Indeed, even at this stage, I predict a time when there will be mathematical investigations of calculi containing contradictions, and people will actually be proud of having emancipated themselves from consistency.<br />
- 7. Predicalc<br />Inconsistency Tolerant Spreadsheets<br />Michael Kassoff, Lee-Ming Zen, Ankit Garg, and Michael Genesereth. PrediCalc: A Logical Spreadsheet Management System 31st International Conference on Very Large Databases (VLDB). 2005.<br />
- 8. Direct Logic<br />A minimal fix<br />to<br />Classical Logic<br />
- 9. Logical Invariance<br />
- 10. DirectArgumentationin Direct Logic<br />Sense Making<br />,( ├T) ├T<br />“├:The Ultimate”<br />
- 11. Transitivity in Argumentation<br />Scientist and engineers speak in the name of new allies that they have shaped and enrolled; representatives among other representatives, they add these unexpected resources to tip the balance of force in their favor.Bruno Latour<br />(├T) , (├T)├S(├T)<br />
- 12. if an argument holds and furthermore if the antecedent of the argument holds, then the consequence of the argument holds.<br />Soundness in Argumentation<br />(├T)├S((├T)├T (├T))<br />whenan argument holdsand<br /> furthermore the antecedent of theargument holds,infer thatthe consequence of the argument holds<br />
- 13. if an argument holds and furthermore if the antecedent of the argument holds, then the consequence of the argument holds.<br />Adequacyin Argumentation<br />(├T)├S(├T(├T))<br />when an inference holds, <br />infer it holds that the inference holds<br />
- 14. if an argument holds and furthermore if the antecedent of the argument holds, then the consequence of the argument holds.<br />Faithfulness in Argumentation<br />(├T(├T))├S(├T)<br />when it holds that an argument holds, <br />infer that the argument holds.<br />
- 15. Roundtripping<br />The execution of code can be dynamically checked against its documentation. Also Web Services can be dynamically searched for and invoked on the basis of their documentation.<br />Use cases can be inferred by specialization of documentation and from code by automatic test generators and by model checking.<br />Code can be generated by inference from documentation and by generalization from use cases.<br />
- 16. Propositionsversus Sentences<br />Sentence<br /> “Gallia estomnisdivisa in partestres.”<br />starts with “Gallia”<br />Proposition<br /> All of Gaul is divided into three parts.<br />believed by Caesar<br />
- 17. Reification and Abstraction<br />Reification<br /> Gallia estomnisdivisa in partestres. <br />“All of Gaul is divided into three parts.”<br />Gallia estomnisdivisa in partestres. <br /> “Todos Galia está dividida en tres partes.” <br />Abstraction<br /> “Gallia estomnisdivisa in partestres.”⇔All of Gaul is divided into three parts.<br />
- 18. Logical Roundtripping<br />├Algebra (y = x+x⇔y = 2*x )<br />because<br />├Algebra(y = x+x⇔y = 2*x)<br />
- 19. RoundtrippingLogical Connectives<br /><ul><li> ⇔</li></ul> ⇔()<br /><ul><li> ├T⇔ ├T</li></ul>∀ ⇔∀<br />
- 20. Hilbert on Incompleteness<br />that within us we always hear the call: here is the problem, search for the solution: you can find it by pure thought, for in mathematics there is no ignorabimus.<br />
- 21. The Gödelian Proposition<br />UninferableT≡ Fix(Diagonalize)<br />where Diagonalize ≡λ(s) ⊬T s<br />
- 22. What is UninferableT?<br />Lemma:UninferableT⇔⊬TUninferableT<br />Proof:<br />UninferableT⇔Fix(Diagonalize)<br />⇔Diagonalize(Fix(Diagonalize))<br />⇔λ(s)⊬Ts (Fix(Diagonalize))<br />⇔⊬TFix(Diagonalize)<br />⇔ ⊬TUninferableT <br />⇔⊬TUninferableT<br />
- 23. Absolute Incompleteness<br />⊬TUninferableT<br />⊬TUninferableT<br />
- 24. Self-Refutation<br />Self Infers Opposite:<br />(├T)├S(├T)<br />Self Infers Argument for Opposite:<br />(├T(├T)) ├S(├T)<br />Argument for Self Infers Opposite:<br />((├T)├T) ├S(├T)<br />Argument for Self Infers Argument for Opposite:<br />((├T)├T(├T)) ├S(├T)<br />
- 25. Proof of Incompleteness<br />1) To prove: ⊬TUninferableTUninferableT⊢T (⊬TUninferableT) lemma (⊢TUninferableT) ⊢T (⊢T⊬TUninferableT)) Soundness⊢T⊬TUninferableT Self-refutation<br />2) To prove: ⊬TUninferableT(UninferableT⊢T ( ⊬TUninferableT) ) lemma (UninferableT) ⊢T(⊢TUninferableT)) Double Negation (⊢TUninferableT) ⊢T (⊢T⊢TUninferableT))Soundness (⊢TUninferableT) ⊢T(⊢TUninferableT)) Faithfulness⊢T⊬TUninferableT Self-refutation<br />
- 26. Incompleteness Redux<br /> Inconsistency tolerant proof:<br />├T(UninferableT⇔⊬T UninferableT )<br />├T(⊬TUninferableT)<br />├T(⊬TUninferableT)<br />
- 27. Absolute Inconsistency<br />├TUninferableT<br />├TUninferableT<br />
- 28. Proof of Inconsistency<br />⊢TUninferableTis immediate from:<br />the incompleteness theorem ⊢T ⊬TUninferableT<br />the lemma ⊢T(UninferableT⇔⊬TUninferableT)<br />⊢TUninferableTis immediate from:<br />immediate above ⊢TUninferableT<br /> contrapositive of lemma<br /> ⊢T(UninferableT⇔⊢T UninferableT)<br />
- 29. Overview<br />State of the art<br />Cherry-picking Wittgenstein<br />Gödel on Wittgenstein<br />Inventing the future<br />
- 30. Ludwig Wittgenstein<br />
- 31. Wittgenstein on “meta-theory”<br />There can’t in any fundamental sense be such a thing as meta-mathematics. . . . Thus, it isn’t enough to say that p is provable, what we must say is: provable according to a particular system.<br />
- 32. Wittgenstein onTruth in PM<br />“True in Russell’s system” [Principia Mathematica (PM)] means, as we have said, proved in Russell's system; and “false in Russell's system” means that the opposite has been proved in Russell's system.<br />
- 33. Wittgenstein onIncompleteness and Inconsistency<br />Let us suppose I prove the unprovability (in Russell’s system[Principia Mathematica (PM)] ) of P[⊢PM⊬PMPwhereP⇔⊬PMP,i.e. P⇔⊢PMP];then by this proof I have proved P[⊢PMP].<br />Now if this proof were one in Russell’s system [⊢PM⊢PMP]—I should in this case have proved at once that it belonged [⊢PMP] and did not belong [⊢PMP]to Russell’s system.—That is what comes of making up such sentences.<br />But there is a contradiction here!—Well, then there is a contradiction here[in PM]. Does it do any harm here?<br />
- 34. Wittgenstein onInconsistency Tolerance<br />Can we say: ‘Contradiction is harmless if it can be sealed off’? But what prevents us from sealing it off?<br />Let us imagine having been taught Frege’s calculus, contradiction and all. But the contradiction is not presented as a disease. It is, rather, an accepted part of the calculus, and we calculate with it.<br />Have said-with pride in a mathematical discovery: “Look, this is how we produce a contradiction.”<br />
- 35. Overview<br />State of the art<br />Cherry-picking Wittgenstein<br />Gödel on Wittgenstein<br />Inventing the future<br />
- 36. Kurt Gödel<br />
- 37. Gödel onWittgenstein<br />It is clear from the passages you cite that Wittgenstein did ''not'' understand it [1st incompleteness theorem] (or pretended not to understand it). He interpreted it as a kind of logical paradox*, while in fact is just the opposite, namely a mathematical theorem within an absolutely uncontroversial part of mathematics (finitary number theory or combinatorics).<br />*in Principia Mathematica<br />
- 38. More Gödel onWittgenstein<br />He [Wittgenstein] has to take a position when he has no business to do so. For example, “you can’t derive everything from a contradiction.” He should try to develop a system of logic in which that is true.It’s amazing that Turing could get anything out of discussions with somebody like Wittgenstein.<br />
- 39. Gödel versusWittgenstein<br />Gödel<br />Mathematics has objective truth<br />Continuum hypothesis?<br />Roundtripping proves incompleteness but (hopefully) not inconsistency<br />Theories should be proved consistent<br />Wittgenstein<br />Mathematics is a community of practice<br />Proof of incompleteness leads to inconsistency<br />Theories should use inconsistency tolerant reasoning<br />
- 40. Tarski onInconsistency<br />I believe everybody agrees that one of the reasons which may compel us to reject an empirical theory is the proof of its inconsistency. . . . It seems to me that the real reason of our attitude is...: We know (if only intuitively) that an inconsistent theory must contain false sentences.<br />
- 41. Frege onTruth<br />when we say that it is true that seawater is salty, we don’t add anything to what we say when we say simply that seawater is salty, so the notion of truth, in spite of being the central notion of [classical]logic, is a singularly ineffectual notion. It is surprising that we would have occasion to use such an impotent notion, nevermind that we would regard it as valuable and important.<br />
- 42. Overview<br />State of the art<br />Cherry-picking Wittgenstein<br />Gödel on Wittgenstein<br />Inventing the future<br />
- 43. Building “a new box”<br />Direct Logic<br />DirectArgumentation (argumentation directly expressed)<br />Direct Inference (no contrapositive bug for inference)<br />Self-refutation<br />Incompleteness self-provable<br />Inconsistency Tolerance<br />Two-way Deduction Theorem for natural deduction<br />Boolean Equivalences hold<br />Concurrency<br />Actor Model<br />iScript TM<br />scriptJ TM<br />
- 44. Boltzman onBloodandTreasure<br />What the poet laments holds for the mathematician. That he writes his works with the blood of his heart.<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

http://wh-stream.stanford.edu/MediaX/CarlHewittEdit.mp4