Ackermann th (7 Ergebnisse)

Softcover. Zustand: Gut. 1. Auflage. Erschienen 1872. Orig.-Brosch., 17x26, S 390-410. Zustand gut bis sehr gut.

Erste /1./ Auflage. 96 Seiten. Gutes Exemplar. Buchrücken mit kl. Ein- bzw. Abrissen. Einband gebrauchsspurig und leicht fleckig. Papier etwas angebräunt. Sprache: Deutsch Gewicht in Gramm: 900 Farbillustr. OBroschur. Kl.8vo. (15x10,5 cm). (= Rheingold-Romane Bd. 51).

VII, 271 S. 8°, HLn., Rückenschild. Einband bestoßen, berieben, Etikettenreste, Flecken, Wasserränder. Papier lichtrandig, stockfleckig. Noch ordentlicher Zustand. Bibliotheksexemplar, Stempel und Signatur im Spiegel. 1000 gr.

Einband in Pappe gebunden, Rücken aus Leinen, 271 S., nach officiellen Mittheilungen und nach Berichten der Prediger, Aerzte und Physiker des Landes im Auftrage des hohen Großherzoglichen Ministeriums, Stempel, wenige Anstreichungen, Ecken und Kanten bestoßen, Besitzvermerk, Rücken etwas fleckig sonst innen sauber erhalten 330 g.…

Zustand: New. In.

Berlin, Springer, 1928. Orig. full cloth. Lower part of spine with loss of cloth. Lower right cornerof titlepage cut away, no loss of letters. VIII,120 pp. First edition. (Die Grundlehren der Mathematischen Wissenshaften in Einzeldarstellungen, Band XXVII). In the years 1917-22 Hilbert gave three seminal courses at the Univeristy og Göttingen on logic and the foundation of mathematics. He received considerable help in preperation and eventual write up of these lectures from Bernays. This material was subsequently reworked by Ackermann into the monograph 'Grundzüge der Theoretischen Logik' (the offered item). It containes the first exposition ever of first-order logic and poses the problem of its completeness and the decision problem ('Entscheidungsproblem'). The first of these questions was answered just a year later by Kurt Gödel in his doctorial dissertation 'Die Vollständigkeit der Axiome des logischen Funktionenkalküls'. This result is known as Gödel's completeness theorem. Two years later Gödel published his famous 1931 paper 'Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I' in which he showed that a stronger logic, capable of modeling arithmetic, is either incomplete or inconsistent (Gödel's second incompleteness theorem). The later question posed by Hilbert and Ackermann regarding the decision problem was answered in 1936 independantly by Alonzo Church and Allan Turing. Church used his model the lambda-calculus and Turing his machine model to construct undecidable problems and show that the decision problem is unsolvable in first-order logic. These results by Gödel, Church, and Turing rank amongst the most important contributions to mathematical logic ever.…

Berlin, Springer, 1928. 8vo. Uncut in orig. printed wrappers. VIII,120. With the name of Bent Schultzer (Former Danish professor in philosophy) on first leaf. Internally clean. First edition. (Die Grundlehren der Mathematischen Wissenshaften in Einzeldarstellungen, Band XXVII). In the years 1917-22 Hilbert gave three seminal courses at the Univeristy og Göttingen on logic and the foundation of mathematics. He received considerable help in preperation and eventual write up of these lectures from Bernays. This material was subsequently reworked by Ackermann into the monograph 'Grundzüge der Theoretischen Logik' (the offered item). It containes the first exposition ever of first-order logic and poses the problem of its completeness and the decision problem ('Entscheidungsproblem'). The first of these questions was answered just a year later by Kurt Gödel in his doctorial dissertation 'Die Vollständigkeit der Axiome des logischen Funktionenkalküls'. This result is known as Gödel's completeness theorem. Two years later Gödel published his famous 1931 paper 'Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I' in which he showed that a stronger logic, capable of modeling arithmetic, is either incomplete or inconsistent (Gödel's second incompleteness theorem). The later question posed by Hilbert and Ackermann regarding the decision problem was answered in 1936 independantly by Alonzo Church and Allan Turing. Church used his model the lambda-calculus and Turing his machine model to construct undecidable problems and show that the decision problem is unsolvable in first-order logic. These results by Gödel, Church, and Turing rank amongst the most important contributions to mathematical logic ever.…