Mathematical Logic : Exercises and Solutions

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00556098" target="_blank" >RIV/67985556:_____/22:00556098 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-030-79010-3" target="_blank" >http://dx.doi.org/10.1007/978-3-030-79010-3</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-79010-3" target="_blank" >10.1007/978-3-030-79010-3</a>

Result language

angličtina

Original language name

Mathematical Logic : Exercises and Solutions

Original language description

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

Czech name

—

Czech description

—

Type

B - Specialist book

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GA19-04579S" target="_blank" >GA19-04579S: Conditonal independence structures: methods of polyhedral geometry</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2022

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

ISBN

978-3-030-79009-7

Number of pages

319

Publisher name

Springer

Place of publication

Cham

UT code for WoS book

—