Mathematical Logic - Csirmaz, Laszlo;Gyenis, Zalán
48,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
24 °P sammeln
  • Gebundenes Buch

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, Kleene's theorems). The work then advances toward propositional logic (compactness and completeness, resolution method), followed by first-order logic, including quantifier elimination and the Ehrenfeucht- Fraïssé game; ultraproducts; and examples for axiomatizability and…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
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, Kleene's theorems). The work then advances toward propositional logic (compactness and completeness, resolution method), followed by first-order logic, including quantifier elimination and the Ehrenfeucht- Fraïssé game; ultraproducts; and examples for axiomatizability and non-axiomatizability. The Arithmetic part covers Robinson's theory, Peano's axiom system, and Gödel's 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 andtopics 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 Gödel's famous completeness and incompleteness theorems. Examples of applications on axiomatizability and decidability of numerous mathematical theories enrich this volume.

Autorenporträt
Laszlo Csirmaz is Senior Researcher at the Institute of Information Theory and Automation (UTIA), Czech Republic and Rényi Alfréd Institute of Mathematics. He started his career in 1975 at the Rényi Institute, where he co-founded the Cryptography Group. From 1996 to 2020, he was Chair of the Computer and Statistics Center at the Central European University, Hungary. Since 1990, he has been delivering lectures at the Eötvös Loránd University, Hungary, mainly on Set Theory and Mathematical Logic, and has held a part-time position at the University of Debrecen, Hungary, from 2001 to 2018. Zalán Gyenis got his Ph.D. in Mathematics in 2013 from the Central European University, Hungary, and has been Premium Postdoctoral Research Fellow at the Hungarian Academy of Sciences. Since 2017, he has been working as Assistant Professor at the Logic Department of the Jagiellonian University, Poland. In 2018, he was awarded the Alfred Tarski Logic Prize.