Andere Kunden interessierten sich auch für
![A Proof Theory for Description Logics]( "A Proof Theory for Description Logics")
A Proof Theory for Description Logics37,99 €![Adapting Proofs-As-Programs]( "Adapting Proofs-As-Programs")
Adapting Proofs-As-Programs192,99 €![Adapting Proofs-as-Programs]( "Adapting Proofs-as-Programs")
Adapting Proofs-as-Programs110,99 €![Automated Theorem Proving]( "Automated Theorem Proving")
Automated Theorem Proving192,99 €![Fundamentals of Logic and Computation]( "Fundamentals of Logic and Computation")
Fundamentals of Logic and Computation44,99 €![Fundamentals of Logic and Computation]( "Fundamentals of Logic and Computation")
Fundamentals of Logic and Computation44,99 €![The P=np Question and Gödel's Lost Letter]( "The P=np Question and Gödel's Lost Letter")
The P=np Question and Gödel's Lost Letter74,99 €
Proofs and Algorithms provides an introduction to the fundamental concepts of logic. Written for those new to the field, the text covers both elementary topics -- proofs, models, recursive functions, etc. -- to more advanced principles.
Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.
Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.
Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.
Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel's incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.
Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
From the reviews:
"This work examines when the application of an algorithm can replace the construction of a proof. ... focuses on establishing that provability is undecidable in predicate logic (Church's theorem). The text generally consists of propositions followed by proofs, with commentary, examples, and exercises interspersed. ... The book would be of interest to those with adequate background. Summing Up: Recommended. Graduate students and above." (J. R. Burke, Choice, Vol. 49 (1), September, 2011)
"Mathematical logic is a challenging subject for many students. ... this book, with its focus on the nature of proofs and algorithms and their relationship, appears to be targeted precisely for such an audience and should appeal to computer scientists and philosophers ... . this book remains an introductory book on mathematical logic suited for a beginning graduate course in logic. ... Its conciseness makes it well suited for a one-semester graduate course." (Burkhard Englert, ACM Computing Reviews, February, 2012)
"This work examines when the application of an algorithm can replace the construction of a proof. ... focuses on establishing that provability is undecidable in predicate logic (Church's theorem). The text generally consists of propositions followed by proofs, with commentary, examples, and exercises interspersed. ... The book would be of interest to those with adequate background. Summing Up: Recommended. Graduate students and above." (J. R. Burke, Choice, Vol. 49 (1), September, 2011)
"Mathematical logic is a challenging subject for many students. ... this book, with its focus on the nature of proofs and algorithms and their relationship, appears to be targeted precisely for such an audience and should appeal to computer scientists and philosophers ... . this book remains an introductory book on mathematical logic suited for a beginning graduate course in logic. ... Its conciseness makes it well suited for a one-semester graduate course." (Burkhard Englert, ACM Computing Reviews, February, 2012)