Nicht aus der Schweiz? Besuchen Sie lehmanns.de

A Course in Mathematical Logic for Mathematicians

(Autor)

Buch | Hardcover
384 Seiten
2009 | 2nd ed. 2010
Springer-Verlag New York Inc.
978-1-4419-0614-4 (ISBN)

Lese- und Medienproben

A Course in Mathematical Logic for Mathematicians - Yu. I. Manin
CHF 89,80 inkl. MwSt
1. The ?rst edition of this book was published in 1977. The text has been well received and is still used, although it has been out of print for some time. In the intervening three decades, a lot of interesting things have happened to mathematical logic: (i) Model theory has shown that insights acquired in the study of formal languages could be used fruitfully in solving old problems of conventional mathematics. (ii) Mathematics has been and is moving with growing acceleration from the set-theoretic language of structures to the language and intuition of (higher) categories, leaving behind old concerns about in?nities: a new view of foundations is now emerging. (iii) Computer science, a no-nonsense child of the abstract computability theory, has been creatively dealing with old challenges and providing new ones, such as the P/NP problem. Planning additional chapters for this second edition, I have decided to focus onmodeltheory,the conspicuousabsenceofwhichinthe ?rsteditionwasnoted in several reviews, and the theory of computation, including its categorical and quantum aspects. The whole Part IV: Model Theory, is new. I am very grateful to Boris I. Zilber, who kindly agreed to write it. It may be read directly after Chapter II. The contents of the ?rst edition are basically reproduced here as Chapters I–VIII. Section IV.7, on the cardinality of the continuum, is completed by Section IV.7.3, discussing H. Woodin’s discovery.

PROVABILITY.- to Formal Languages.- Truth and Deducibility.- The Continuum Problem and Forcing.- The Continuum Problem and Constructible Sets.- COMPUTABILITY.- Recursive Functions and Church#x2019;s Thesis.- Diophantine Sets and Algorithmic Undecidability.- PROVABILITY AND COMPUTABILITY.- G#x00F6;del#x2019;s Incompleteness Theorem.- Recursive Groups.- Constructive Universe and Computation.- MODEL THEORY.- Model Theory.

Erscheint lt. Verlag 30.10.2009
Reihe/Serie Graduate Texts in Mathematics ; 53
Co-Autor B. Zilber
Übersetzer Neal Koblitz
Zusatzinfo 12 Illustrations, black and white; XVIII, 384 p. 12 illus.
Verlagsort New York, NY
Sprache englisch
Maße 155 x 235 mm
Themenwelt Geisteswissenschaften Philosophie Logik
Mathematik / Informatik Mathematik Allgemeines / Lexika
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 1-4419-0614-2 / 1441906142
ISBN-13 978-1-4419-0614-4 / 9781441906144
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich

von Sandra Markewitz; Ansgar Lorenz

Buch | Softcover (2024)
Brill | Fink (Verlag)
CHF 27,85
ein Gegenentwurf zum kurzfristigen Denken : so werden wir zu den …

von Ari Wallach

Buch | Hardcover (2023)
REDLINE (Verlag)
CHF 27,90
eine logische Untersuchung

von Gottlob Frege; Uwe Voigt

Buch | Softcover (2024)
Phillip Reclam (Verlag)
CHF 7,25