Includes applications in game theory and Nash's equilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting
Focuses of foundations, with specific statements of all the associated axioms and rules of logic and set theory
Provides complete details and derivations of formal proofs
Develops the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory
Provides copious references to literature that documents historical development
Yves Nievergelt is professor of mathematics at Eastern Washington University. His research interests include applied analysis (mathematics applied to chemistry, medical diagnostic imaging, and physics), complex analysis, and numerical analysis (mathematics of scientific programming).
This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkh?user, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory. The focuses is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided.
Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so unintuitive? Why are there no recipes to design proofs? Where do these numerous mathematical rules come from? What issues in logic, mathematics, and computer science still remain unresolved? And the perennial question: In what ways are we going to use this material? Additionally, the selection of topics presented reflects many major accomplishments from the twentieth century and includes applications in game theory and Nash's
equilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting, to name a few.
From the reviews of the first edition:
"...All the results are proved in full detail from first principles...remarkably, the arithmetic laws on the rational numbers are proved, step after step, starting from the very definitions!...This is a valuable reference text and a useful companion for anybody wondering how basic mathematical concepts can be rigorously developed within set theory."
—MATHEMATICAL REVIEWS
"Rigorous and modern in its theoretical aspect, attractive as a detective novel in its applied aspects, this paper book deserves the attention of both beginners and advanced students in mathematics, logic and computer sciences as well as in social sciences."
—Zentralblatt MATH
Preface.- 1. Propositional Logic: Proofs from Axioms and Inference Rules.- 2. First Order Logic: Proofs with Quantifiers.- 3. Set Theory: Proofs by Detachment, Contraposition, and Contradiction.- 4. Mathematical Induction: Definitions and Proofs by Induction.- 5. Well-Formed Sets: Proofs by Transfinite Induction with Already Well-Ordered Sets.- 6. The Axiom of Choice: Proofs by Transfinite Induction.- 7. Applications: Nobel-Prize Winning Applications of Sets, Functions, and Relations.- 8. Solutions to Some Odd-Numbered Exercises.- References.- Index.
This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkh?user, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory. The focus is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided.
Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so unintuitive? Why are there no recipes to design proofs? Where do these numerous mathematical rules come from? What issues in logic, mathematics, and computer science still remain unresolved? And the perennial question: In what ways are we going to use this material? Additionally, the selection of topics presented reflects many major accomplishments from the twentieth century and includes applications in game theory and Nash's e
quilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting, to name a few.
From the reviews of the first edition:
"...All the results are proved in full detail from first principles...remarkably, the arithmetic laws on the rational numbers are proved, step after step, starting from the very definitions!...This is a valuable reference text and a useful companion for anybody wondering how basic mathematical concepts can be rigorously developed within set theory."
—MATHEMATICAL REVIEWS
"Rigorous and modern in its theoretical aspect, attractive as a detective novel in its applied aspects, this paper book deserves the attention of both beginners and advanced students in mathematics, logic and computer sciences as well as in social sciences."
—Zentralblatt MATH
"This book could be a valuable reference text and would be useful to one who would like to know how basic mathematical primitives can be rigorously developed within basic set theory.” (Rana Barua, Mathematical Reviews, June, 2016)
It is quite suitable for a first- or second-year university course where the hand of the lecturer can guide the student through the material. There are fairly comprehensive sets of problems at the end of each chapter ... . In summary, the book is a very thorough treatment of the topics ... . It is quite suitable as a textbook for an undergraduate course in the logic and mathematics that underpin a computer science course. The exercises are comprehensive.” (Martin Schweitzer, Computing Reviews, computingreviews.com, May, 2016)
"This introductory textbook on logic and set theory stands out in that it does not only present its mathematical content in a thorough and accessible way, but also giving historical and philosophical background ... . The book contains many exercises that should serve to further the understanding of the reader ... . The book should be accessible to readers with a basic general background in mathematics.” (Merlin Carl, zbMATH 1334.03002, 2016)
This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkh user, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory. The focuses is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided.
Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so unintuitive? Why are there no recipes to design proofs? Where do these numerous mathematical rules come from? What issues in logic, mathematics, and computer science still remain unresolved? And the perennial question: In what ways are we going to use this material? Additionally, the selection of topics presented reflects many major accomplishments from the twentieth century and includes applications in game theory and Nash's
equilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting, to name a few.
From the reviews of the first edition:
"...All the results are proved in full detail from first principles...remarkably, the arithmetic laws on the rational numbers are proved, step after step, starting from the very definitions!...This is a valuable reference text and a useful companion for anybody wondering how basic mathematical concepts can be rigorously developed within set theory."
-MATHEMATICAL REVIEWS
"Rigorous and modern in its theoretical aspect, attractive as a detective novel in its applied aspects, this paper book deserves the attention of both beginners and advanced students in mathematics, logic and computer sciences as well as in social sciences."
-Zentralblatt MATH
Preface.- 1. Propositional Logic: Proofs from Axioms and Inference Rules.- 2. First Order Logic: Proofs with Quantifiers.- 3. Set Theory: Proofs by Detachment, Contraposition, and Contradiction.- 4. Mathematical Induction: Definitions and Proofs by Induction.- 5. Well-Formed Sets: Proofs by Transfinite Induction with Already Well-Ordered Sets.- 6. The Axiom of Choice: Proofs by Transfinite Induction.- 7. Applications: Nobel-Prize Winning Applications of Sets, Functions, and Relations.- 8. Solutions to Some Odd-Numbered Exercises.- References.- Index.
"This book could be a valuable reference text and would be useful to one who would like to know how basic mathematical primitives can be rigorously developed within basic set theory." (Rana Barua, Mathematical Reviews, June, 2016)
It is quite suitable for a first- or second-year university course where the hand of the lecturer can guide the student through the material. There are fairly comprehensive sets of problems at the end of each chapter ... . In summary, the book is a very thorough treatment of the topics ... . It is quite suitable as a textbook for an undergraduate course in the logic and mathematics that underpin a computer science course. The exercises are comprehensive." (Martin Schweitzer, Computing Reviews, computingreviews.com, May, 2016)
"This introductory textbook on logic and set theory stands out in that it does not only present its mathematical content in a thorough and accessible way, but also giving historical and philosophical background ... . The book contains many exercises that should serve to further the understanding of the reader ... . The book should be accessible to readers with a basic general background in mathematics." (Merlin Carl, zbMATH 1334.03002, 2016)
Yves Nievergelt is professor of mathematics at Eastern Washington University. His research interests include applied analysis (mathematics applied to chemistry, medical diagnostic imaging, and physics), complex analysis, and numerical analysis (mathematics of scientific programming).
Über den Autor
Yves Nievergelt is professor of mathematics at Eastern Washington University. His research interests include applied analysis (mathematics applied to chemistry, medical diagnostic imaging, and physics), complex analysis, and numerical analysis (mathematics of scientific programming).
Inhaltsverzeichnis
Preface.- 1. Propositional Logic: Proofs from Axioms and Inference Rules.- 2. First Order Logic: Proofs with Quantifiers.- 3. Set Theory: Proofs by Detachment, Contraposition, and Contradiction.- 4. Mathematical Induction: Definitions and Proofs by Induction.- 5. Well-Formed Sets: Proofs by Transfinite Induction with Already Well-Ordered Sets.- 6. The Axiom of Choice: Proofs by Transfinite Induction.- 7. Applications: Nobel-Prize Winning Applications of Sets, Functions, and Relations.- 8. Solutions to Some Odd-Numbered Exercises.- References.- Index.
Klappentext
This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkh¿user, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory. The focuses is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided.
Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so unintuitive? Why are there no recipes to design proofs? Where do these numerous mathematical rules come from? What issues in logic, mathematics, and computer science still remain unresolved? And the perennial question: In what ways are we going to use this material? Additionally, the selection of topics presented reflects many major accomplishments from the twentieth century and includes applications in game theory and Nash's equilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting, to name a few.
From the reviews of the first edition:
"...All the results are proved in full detail from first principles...remarkably, the arithmetic laws on the rational numbers are proved, step after step, starting from the very definitions!...This is a valuable reference text and a useful companion for anybody wondering how basic mathematical concepts can be rigorously developed within set theory."
-MATHEMATICAL REVIEWS
"Rigorous and modern in its theoretical aspect, attractive as a detective novel in its applied aspects, this paper book deserves the attention of both beginners and advanced students in mathematics, logic and computer sciences as well as in social sciences."
-Zentralblatt MATH
Includes applications in game theory and Nash's equilibrium, Gale and Shapley's match making algorithms, Arrow's Impossibility Theorem in voting
Focuses of foundations, with specific statements of all the associated axioms and rules of logic and set theory
Provides complete details and derivations of formal proofs
Develops the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory
Provides copious references to literature that documents historical development
