Mathematical Logic

By: Ebbinghaus, Heinz-DieterContributor(s): Thomas, Wolfgang | Flum, JörgMaterial type: TextTextLanguage: English Series: Graduate Texts in Mathematics ; 291Publication details: New York Springer 2021Edition: 3rd edDescription: ix, 304pISBN: 9783030738419 (PB)Subject(s): Logic -- Computer Science | Mathematics
Contents:
I. 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
Summary: This 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.
Item type: BOOKS List(s) this item appears in: New Arrivals (19 July 2024)
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified Status Date due Barcode
IMSc Library
IMSc Library
510.2 EBB (Browse shelf (Opens below)) Available 78072

Includes References (291-292)

I. 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

This 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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha