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.Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
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.Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 17,11 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 11,00 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 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 Gödel's famous completeness and incompleteness theorems. Examples of applications on axiomatizability and decidability of numerous mathematical theories enrich this volume. 328 pp. Englisch. Codice articolo 9783030790097
Quantità: 2 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783030790097_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 43109361-n
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 43109361
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 43109361
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 43109361-n
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Offers a broad set of problems in Mathematical Logic, starting from its supporting fields and advancing toward key theoremsEnables the student to prove the main theorems himself, including Goedel s famous completeness and incompleteness theorems. Codice articolo 473131253
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9783030790097
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783030790097
Quantità: 1 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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, Peanö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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 328 pp. Englisch. Codice articolo 9783030790097
Quantità: 1 disponibili