formally undecidable propositions principia mathematica de gödel kurt (21 résultats)

Etat : Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Etat : good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

Etat : Good. 1 Edition. Used book that is in clean, average condition without any missing pages.

Etat : New. In.

Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days. 160.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : As New. Unread book in perfect condition.

Kartoniert / Broschiert. Etat : New. KlappentextrnrnFirst English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : Brand New. reprint edition. 80 pages. 8.00x5.25x0.50 inches. In Stock.

Paperback. Etat : new. Paperback. In 1931, a young Austrian mathematician published an epoch-making paper containing one of the most revolutionary ideas in logic since Aristotle. Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. The repercussions of this discovery are still being felt and debated in 20th-century mathematics.The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite. First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Etat : new. Paperback. In 1931, a young Austrian mathematician published an epoch-making paper containing one of the most revolutionary ideas in logic since Aristotle. Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. The repercussions of this discovery are still being felt and debated in 20th-century mathematics.The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite. First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Etat : acceptable. Fast & Free Shipping â" A well-used but reliable copy with all text fully readable. Pages and cover remain intact, though wear such as notes, highlighting, bends, or library marks may be present. Supplemental items like CDs or access codes may not be included.

Paperback. Etat : new. Paperback. In 1931, a young Austrian mathematician published an epoch-making paper containing one of the most revolutionary ideas in logic since Aristotle. Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. The repercussions of this discovery are still being felt and debated in 20th-century mathematics.The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite. First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Etat : acceptable. The item is very worn but is perfectly usable. Signs of wear can include aesthetic issues such as scratches, dents, worn and creased covers, folded page corners and minor liquid stains. All pages and the cover are intact, but the dust cover may be missing. Pages may include moderate to heavy amount of notes and highlighting, but the text is not obscured or unreadable. Page edges may have foxing age related spots and browning . May NOT include discs, access code or other supplemental materials.

paperback. Etat : New. In shrink wrap. Looks like an interesting title!

First Edition in English, American issue, of 'Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme' (Monatshefte fur Mathematik und Physik, xxxviii (1931), pp. 173-98). viii, 72 pp. Original cloth-backed boards. Lower corner of rear board slightly bumped and cracked, paper clip attached to p. 33/34. Else Very Good, without dust jacket. "Gödel is best known for his proof of 'Gödel's Incompleteness Theorems'. In 1931 he published these results in Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. He proved fundamental results about axiomatic systems, showing in any axiomatic mathematical system there are propositions that cannot be proved or disproved within the axioms of the system. In particular the consistency of the axioms cannot be proved. This ended a hundred years of attempts to establish axioms which would put the whole of mathematics on an axiomatic basis. One major attempt had been by Bertrand Russell with Principia Mathematica (1910-13). Another was Hilbert's formalism which was dealt a severe blow by Gödel's results. The theorem did not destroy the fundamental idea of formalism, but it did demonstrate that any system would have to be more comprehensive than that envisaged by Hilbert. Gödel's results were a landmark in 20th-century mathematics, showing that mathematics is not a finished object, as had been believed. It also implies that a computer can never be programmed to answer all mathematical questions" (MacTutor History of Mathematics Web site).

First edition of Godel's classic work. Octavo, original cloth. Near fine in a very good dust jacket, small name to the title page. Translated by B. Meltzer. Introduction by R.B. Braithwaite. Uncommon in the original dust jacket. In 1931, a young Austrian mathematician published an epoch-making paper containing one of the most revolutionary ideas in logic since Aristotle. Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. The repercussions of this discovery are still being felt and debated in 20th-century mathematics. The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.

First edition in English, first impression, of the famed incompleteness theorems, overturning a century of efforts to place the whole of mathematics on an axiomatic basis and proving that the bounds cannot be those of one formal system. This edition includes a preface by R. B. Braithwaite (1900-1990), Knightbridge Professor of Moral Philosophy at Cambridge. For Gödel, even in elementary arithmetic there exist propositions that cannot be proven or disproven within the system. Mathematics is not finished, as had been believed, and computers can never be programmed to answer all mathematical questions. The theorems were originally published in Monatshefte für Mathematik in 1931. Newman, pp. 1668-95. Octavo. Formulae in the text. Original light green cloth, spine lettered in red. With dust jacket. With bookseller's ticket of Dillon's University Bookshop, London, to front pastedown. Boards gently splayed, rear cover faintly mottled; jacket unclipped, spine toned, extremities creased, closed tears to rear cover sometime repaired with tape on recto and verso: a very good copy in like jacket.