895 kr
Skickas inom 11-20 vardagar
895 kr
Skickas inom 11-20 vardagar
880 kr
Läs direkt efter köp
765 kr
Skickas inom 10-15 vardagar
728 kr
Läs direkt efter köp
This textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof? How can mathematical proofs be justified? Are there limitations to provability? To what extent can machines carry out mathematical proofs? In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.
The chapters are carefully organized, featuring complete proofs and numerous examples throughout. Beginning with motivating examples, the book goes on to present the syntax and semantics of first-order logic. After providing a sequent calculus for this logic, a Henkin-type proof of the completeness theorem is given. These introductory chapters prepare the reader for the advanced topics that follow, such as Gödel''s Incompleteness Theorems, Trakhtenbrot''s undecidability theorem, Lindström''s theorems on the maximality of first-order logic, and results linking logic with automata theory. This new edition features many modernizations, as well as two additional important results: The decidability of Presburger arithmetic, and the decidability of the weak monadic theory of the successor function.
Mathematical Logic is ideal for students beginning their studies in logic and the foundations of mathematics. Although the primary audience for this textbook will be graduate students or advanced undergraduates in mathematics or computer science, in fact the book has few formal prerequisites. It demands of the reader only mathematical maturity and experience with basic abstract structures, such as those encountered in discrete mathematics or algebra.
549 kr
Skickas inom 10-15 vardagar
788 kr
Skickas inom 10-15 vardagar
1 427 kr
Läs direkt efter köp
1 123 kr
Skickas inom 10-15 vardagar
1 007 kr
Läs direkt efter köp
A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or control systems.
For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games.
The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.
739 kr
Läs direkt efter köp
567 kr
Skickas inom 10-15 vardagar
567 kr
Skickas inom 10-15 vardagar
1 127 kr
Skickas inom 10-15 vardagar
1 502 kr
Läs direkt efter köp
1 085 kr
Skickas inom 7-10 vardagar
1 459 kr
Läs direkt efter köp
1 123 kr
Skickas inom 10-15 vardagar
1 459 kr
Läs direkt efter köp
464 kr
Skickas inom 10-15 vardagar
489 kr
Läs direkt efter köp
478 kr
Skickas inom 10-15 vardagar
560 kr
Läs direkt efter köp