Kurt Godel was the most outstanding logician of the twentieth century, famous for his work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum hypothesis. He is also noted for his work on constructivity, the decision problem, and the foundations of computation theory, as well as for the strong individuality of his writings on the philosophy of mathematics. Less well-known is his discovery of unusual cosmological models for Einstein's (...) equations, permitting "time-travel" into the past. This second volume of a comprehensive edition of Godel's works collects together all his publications from 1938 to 1974. Together with Volume I (Publications 1929-1936), it makes available for the first time in a single source all of his previously published work. Continuing the format established in the earlier volume, the present text includes introductory notes that provide extensive explanatory and historical commentary on each of the papers, a facing English translation of the one German original, and a complete bibliography. Succeeding volumes are to contain unpublished manuscripts, lectures, correspondence, and extracts from the notebooks. Collected Works is designed to be accessible and useful to as wide an audience as possible without sacrificing scientific or historical accuracy. The only complete edition available in English, it will be an essential part of the working library of professionals and students in logic, mathematics, philosophy, history of science, and computer science. These volumes will also interest scientists and all others who wish to be acquainted with one of the great minds of the twentieth century. (shrink)

Die theoretische Logik, auch mathematische oder symbolische Logik genannt, ist eine Ausdehnung der fonnalen Methode der Mathematik auf das Gebiet der Logik. Sie wendet fUr die Logik eine ahnliche Fonnel­ sprache an, wie sie zum Ausdruck mathematischer Beziehungen schon seit langem gebrauchlich ist. In der Mathematik wurde es heute als eine Utopie gelten, wollte man beim Aufbau einer mathematischen Disziplin sich nur der gewohnlichen Sprache bedienen. Die groBen Fortschritte, die in der Mathematik seit der Antike gemacht worden sind, sind zum (...) wesentlichen Teil mit dadurch bedingt, daB es gelang, einen brauchbaren und leistungsfahigen Fonnalismus zu finden. - Was durch die Formel­ sprache in der Mathematik erreicht wird, das solI auch in der theoretischen Logik durch diese erzielt werden, namlich eine exakte, wissenschaftliche Behandlung ihres Gegenstandes. Die logischen Sachverhalte, die zwischen Urteilen, Begriffen usw. bestehen, finden ihre Darstellung durch Formeln, deren Interpretation frei ist von den Unklarheiten, die beim sprachlichen Ausdruck leicht auftreten konnen. Der Dbergang zu logischen Folgerungen, wie er durch das SchlieBen geschieht, wird in seine letzten Elemente zerlegt und erscheint als fonnale Umgestaltung der Ausgangsfonneln nach gewissen Regeln, die den Rechenregeln in der Algebra analog sind; das logische Denken findet sein Abbild in einem LogikkalkUl. Dieser Kalkiil macht die erfolgreiche Inangriffnahme von Problemen moglich, bei denen das rein inhaltliche Denken prinzipiell versagt. Zu diesen gehort z. B. (shrink)

We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order set theory and second-order logic are not radically (...) different: the latter is a major fragment of the former. (shrink)

We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest conflict with each (...) other. However, our conclusion is that it is very difficult to see any real difference between the two. We analyze a phenomenon we call internal categoricity which extends the familiar categoricity results of second order logic to Henkin models and show that set theory enjoys the same kind of internal categoricity. Thus the existence of non-standard models, which is usually taken as a property of first order set theory, and categoricity, which is usually taken as a property of second order axiomatizations, can coherently coexist when put into their proper context. We also take a fresh look at complete second order axiomatizations and give a hierarchy result for second order characterizable structures. Finally we consider the problem of existence in mathematics from both points of view and find that second order logic depends on what we call large domain assumptions, which come quite close to the meaning of the axioms of set theory. (shrink)

We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...) models for these systems. In both cases we give a consistency proof, but naturally we have to assume more than the mere comprehension axioms. (shrink)

In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our Boolean-valued second-order logic, the second-order variables range over all Boolean-valued subsets and relations on the domain. We show that under large cardinal assumptions Boolean-valued second-order logic is more robust than full second-order logic. Its (...) validity is absolute under forcing, and its Hanf and Löwenheim numbers are smaller than those of full second-order logic. (shrink)