000 04391nam a22005175i 4500
001 978-3-031-55368-4
003 DE-He213
005 20251030112030.0
007 cr nn 008mamaa
008 240506s2024 sz | s |||| 0|eng d
020 _a9783031553684
_9978-3-031-55368-4
024 7 _a10.1007/978-3-031-55368-4
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBCD
_2bicssc
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBCD
_2thema
072 7 _aPBC
_2thema
100 1 _aMarker, David.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_976449
245 1 3 _aAn Invitation to Mathematical Logic
_h[electronic resource] /
_cby David Marker.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXVIII, 357 p. 7 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aGraduate Texts in Mathematics,
_x2197-5612 ;
_v301
505 0 _aIntroduction -- I. Truth and Proof -- 1 Languages, Structures and Theories -- 2 Embeddings and Substructures -- 3 Formal Proofs -- 4 Gödel's Completeness Theorem -- II. Elements of Model Theory -- 5 Compactness and Complete Theories -- 6 Ultraproducts -- 7 Quantifier Elimination -- 8 Model Theory of the Real Field -- III. Computability -- 9 Models of Computation -- 10 Universal Machines and Undecidability -- 11 Computably Enumerable and Arithmetic Sets -- 12 Turing Reducibility -- IV. Arithmetic and Incompleteness.-13 Gödel's Incompleteness Theorems -- 14 Hilbert’s 10th Problem -- 15 Peano Arithmetic and ϵ0 -- 16 Models of Arithmetic and Independence Results. - Appendices -- A Set Theory. - B Unique Readability. - C Real Algebra. -Bibliography. - Index.
520 _aIn addition to covering the essentials, the author’s intention in writing this text is to entice the reader to further study mathematical logic. There is no current “standard text” for a first graduate course in mathematical logic and this book will fill that gap. While there is more material than could be covered in a traditional one semester course, an instructor can cover the basics and still have the flexibility to choose several weeks’ worth of interesting advanced topics that have been introduced. The text can and will be used by people in various courses with different sorts of perspectives. This versatility is one of the many appealing aspects of this book. A list of suggested portions to be covered in a single course is provided as well as a useful chart which maps chapter dependencies. Additionally, a motivated student will have ample material for further reading. New definitions, formalism, and syntax have been streamlined to engage the reader quickly into the heart of logic and to more sophisticated topics. Part I and Part IV center on foundational questions, while Part III establishes the fundamentals of computability. Part II develops model theory, highlighting the model theory of the fields of real and complex numbers. The interplay between logic and other areas of mathematics, notably algebra, number theory, and combinatorics, are illustrated in Chapters 5, 6, 8, 14, and 16. For most of the text, the only prerequisite is mathematical maturity. The material should be accessible to first year graduate students or advanced undergraduates in mathematics, graduate students in philosophy with a solid math background, or students in computer science who want a mathematical introduction to logic. Prior exposure to logic is helpful but not assumed.
650 0 _aMathematical logic.
_966195
650 1 4 _aMathematical Logic and Foundations.
_966198
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031553677
776 0 8 _iPrinted edition:
_z9783031553691
776 0 8 _iPrinted edition:
_z9783031553707
830 0 _aGraduate Texts in Mathematics,
_x2197-5612 ;
_v301
_972308
856 4 0 _uhttps://doi.org/10.1007/978-3-031-55368-4
912 _aZDB-2-SMA
912 _aZDB-2-SXMS
999 _c59678
_d59678