000			01581nam a22002537a 4500
008			240708b |||||||| |||| 00| 0 eng d
020			_a9783030738419 (PB)
041			_aeng
080			_a510.2 _bEBB
100			_aEbbinghaus, Heinz-Dieter
245			_aMathematical Logic
250			_a3rd ed
260			_aNew York _bSpringer _c2021
300			_aix, 304p.
490			_aGraduate Texts in Mathematics _v291
504			_aIncludes References (291-292)
505			_aI. Introduction II. Syntax of First-Order Languages III. Semantics of First-Order Languages IV. A Sequent Calculus V. The Completeness Theorem VI. The Lowenheim-Skolem and the Compactness Theorem VII. The Scope of First-Order Logic VIII. Syntactic Interpretations and Normal Forms IX. Extensions of First-Order Logic X. Computability and its Limitations XI. Free Models and Logic Programming XII. An Algebraic Characterization of Elementary Equivalence XIII. Lindstrom's Theorems
520			_aThis textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof? How can mathematical proofs be justified? Are there limitations to provability? To what extent can machines carry out mathematical proofs? In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.
650			_aLogic -- Computer Science
690			_aMathematics
700			_aThomas, Wolfgang
700			_aFlum, Jörg
942			_cBK
999			_c60509 _d60509