Mathematical logic : exercises and solutions / Laszlo Csirmaz, Zalán Gyenis.
2022
QA9
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Mathematical logic : exercises and solutions / Laszlo Csirmaz, Zalán Gyenis.
Author
Csirmaz, László, author.
ISBN
9783030790103 (electronic bk.)
303079010X (electronic bk.)
9783030790110
3030790118
9783030790127
3030790126
3030790096
9783030790097
303079010X (electronic bk.)
9783030790110
3030790118
9783030790127
3030790126
3030790096
9783030790097
Publication Details
Cham, Switzerland : Springer, 2022.
Language
English
Description
1 online resource
Item Number
10.1007/978-3-030-79010-3 doi
Call Number
QA9
Dewey Decimal Classification
511.3
Summary
This book gathers together a colorful set of problems on classical Mathematical Logic, selected from over 30 years of teaching. The initial chapters start with problems from supporting fields, like set theory (ultrafilter constructions), full-information game theory (strategies), automata, and recursion theory (decidability, Kleenes theorems). The work then advances toward propositional logic (compactness and completeness, resolution method), followed by first-order logic, including quantifier elimination and the Ehrenfeucht Fraisse game; ultraproducts; and examples for axiomatizability and non-axiomatizability. The Arithmetic part covers Robinsons theory, Peanos axiom system, and Godels incompleteness theorems. Finally, the book touches universal graphs, tournaments, and the zero-one law in Mathematical Logic. Instructors teaching Mathematical Logic, as well as students who want to understand its concepts and methods, can greatly benefit from this work. The style and topics have been specially chosen so that readers interested in the mathematical content and methodology could follow the problems and prove the main theorems themselves, including Godels famous completeness and incompleteness theorems. Examples of applications on axiomatizability and decidability of numerous mathematical theories enrich this volume.
Note
Includes index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed March 30, 2022).
Added Author
Gyenis, Zalán, author.
Series
Problem books in mathematics, 2197-8506
Available in Other Form
Print version: 9783030790097
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
Chapter 1 - Special Set Systems
Chapter 2 - Games and Voting
Chapter 3 - Formal languages and automata
Chapter 4 - Recursion Theory
Chapter 5 - Propositional Calculus
Chapter 6 - First-order logic
Chapter 7 - Fundamental Theorems
Chapter 8 - Elementary Equivalence
Chapter 9 - Ultraproducts
Chapter 10 - Arithmetic
Chapter 11 - Selected Applications
Chapter 12 - Solutions.
Chapter 2 - Games and Voting
Chapter 3 - Formal languages and automata
Chapter 4 - Recursion Theory
Chapter 5 - Propositional Calculus
Chapter 6 - First-order logic
Chapter 7 - Fundamental Theorems
Chapter 8 - Elementary Equivalence
Chapter 9 - Ultraproducts
Chapter 10 - Arithmetic
Chapter 11 - Selected Applications
Chapter 12 - Solutions.