Kurt Gödel: Collected Works: Volume I: Publications 1929-1936OUP USA, 1986/05/22 - 490 ページ Kurt Gödel (1906 - 1978) was the most outstanding logician of the twentieth century, famous for his hallmark works 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 computability theory, as well as for the strong individuality of his writings on the philosophy of mathematics. He is less well known for his discovery of unusual cosmological models for Einstein's equations, in theory permitting time travel into the past. The Collected Works is a landmark resource that draws together a lifetime of creative thought and accomplishment. The first two volumes were devoted to Gödel's publications in full (both in original and translation), and the third volume featured a wide selection of unpublished articles and lecture texts found in Gödel's Nachlass. These long-awaited final two volumes contain Gödel's correspondence of logical, philosophical, and scientific interest. Volume IV covers A to G, with H to Z in volume V; in addition, Volume V contains a full inventory of Gödel's Nachlass. L All volumes include introductory notes that provide extensive explanatory and historical commentary on each body of work, English translations of material originally written in German (some transcribed from the Gabelsberger shorthand), and a complete bibliography of all works cited. Kurt Gödel: Collected Works is designed to be useful and accessible to as wide an audience as possible without sacrificing scientific or historical accuracy. The only comprehensive edition of Gödel's work available, it will be an essential part of the working library of professionals and students in logic, mathematics, philosophy, history of science, and computer science and all others who wish to be acquainted with one of the great minds of the twentieth century. |
目次
Gödels life and work by Solomon Feferman | 1 |
Review of von Juhos 1930 | 8 |
A Gödel chronology by John W Dawson Jr | 37 |
Introductory note to 1929 1930 and 1930a | 44 |
Introductory note to 1932 by A S Troelstra | 53 |
See introductory note under Gödel 1929 | 102 |
See introductory note under Gödel 1929 | 124 |
See introductory note under Gödel 1930b | 144 |
Review of Dingler 1931 | 265 |
Introductory note to 1933b c d g and | 272 |
See introductory note under Gödel 1933b | 278 |
Introductory note to 1933f by A S Troelstra | 296 |
See introductory note under Gödel 1933b | 302 |
Review of Kaczmarz 1932 | 327 |
Review of Hahn 1932 | 333 |
On undecidable propositions of formal mathematical systems | 346 |
Introductory note to 1931a 1932e ƒ and | 196 |
Review of Neder 1931 | 205 |
Review of Betsch 1926 | 215 |
Zum intuitionistischen Aussagenkalkül | 222 |
See introductory note under Gödel 1930b | 234 |
See introductory note under Gödel 1931a | 247 |
Review of Hoensbroech 1931 | 253 |
Review of Kalmár 1932 | 259 |
他の版 - すべて表示
多く使われている語句
Ackermann arithmetic Ausdruck axiom of choice axiom system axiomatic set theory Axiomen Begriffe beliebige Bernays Beweis beweisbar consistency consistency proofs continuum hypothesis daher decision problem defined definition denumerable domain E-complex Einsetzung elements endlich Entscheidungsproblem entweder equivalent erfüllbar ergibt expression ferner finitary folgende folgenden folgt formal system formula free variable functional variables Funktionen gibt gilt Gödel number hence Herbrand Hilbert Hilbert's program Hilfssatz ibid incompleteness introductory note intuitionistic Jean van Heijenoort journal of symbolic Klasse Kleene Kurt Gödel Lemma Logik logischen mathematics Mathematik Menger metamathematical natural numbers natürliche Zahlen Neumann notion number theory predicate primitive recursive Principia mathematica problem proof propositional calculus provable proved quantifiers recursive functions refutable rekursiv relation rules of inference satisfiable Satz Sätze set theory Skolem soll symbolic logic Tarski theorem tion translation undecidable propositions universal quantifiers Variablen w-consistent widerlegbar wobei Zahl Zeichen zwei