Complexity and decidability
algorithmsarithmeticBoolean calculuscomplexity theorydecidabilityfirst- order logicrecursive functionsTuring machines
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) First-order arithmetic and fragments (03F30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This book is the supporting text of the course taught by the author at the University of Caen. It includes main results in complexity theory concerning first-order logic. The author emphasizes on the main negative results concerning the complexity of Boolean calculus, first-order logic and of arithmetic. The theory is presented in the standard model of Turing machines. The model is largely studied in the first six chapters of the book. Thus, the reader may not be familiar with complexity and even logic theories. We note the elegant manner the author succeeds in giving a rigorous and at the same time easy to understand presentation of some difficult results. Here are the chapters of the book: 1. Algorithmes et machines de Turing, 2. Simulation d'algorithmes, 3. Changement de réprésentation, 4. Fonctions récursives, 5. Machines universelles, 6. Machines non déterministes, 7. Complexité du calcul booléen, 8. Complexité des logiques du premier ordre, 9. Complexité de l'arithmétique, 10. Complexité de l'addition des entiers.
This page was built for publication: Complexity and decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1308646)
