This is a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of propositionaland first-order logic through the Soundness, Completeness, and Compactness Theorems. Volume II, Computation, covers the basics of computability using Turing machines and recursive f
A Problem Course in Mathematical Logic Volume 2
โ Scribed by Bilaniuk S.
- Book ID
- 127398347
- Year
- 1997
- Tongue
- English
- Weight
- 407 KB
- Edition
- version 1.3
- Category
- Library
- ISBN-13
- 9780394745022
No coin nor oath required. For personal study only.
โฆ Synopsis
This is the Volume II of a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of computability, using Turing machines and recursive functions, and Goedel's Incompleteness Theorem, and could be used for a one semester course on these topics. Volume I, Propositional and First-Order Logic, covers the basics of these topics through the Soundness, Completeness, and Compactness Theorems. Information on availability and the conditions under which this book may be used and reproduced are given in the preface.
๐ SIMILAR VOLUMES
A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included.
*A Course in Mathematical Logic for Mathematicians, Second Edition* offers a straightforward introduction to modern mathematical logic that will appeal to the intuition of working mathematicians. The book begins with an elementary introduction to formal languages and proceeds to a discussion of proo
This is an overview of the current state of knowledge along with open problems and perspectives, clarified in such fields as non-standard inferences in description logics, logic of provability, logical dynamics and computability theory. The book includes contributions concerning the role of logic to
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to under