Logic, Mathematics, and Computer Science
Springer-Verlag New York Inc.
978-1-4939-3222-1 (ISBN)
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
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).
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.
Zusatzinfo | 4 Illustrations, color; 5 Illustrations, black and white; XII, 391 p. 9 illus., 4 illus. in color. |
---|---|
Verlagsort | New York |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie | |
Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
Schlagworte | applications sets and functions • First-Order Logic • foundations mathematics • Gale and Shapely algorithm • inference rules • Mathematical Induction • Math transition course textbook • Nash Equilibrium • Prisoner's dilemma • propositional logic • set theory • Transfinite induction |
ISBN-10 | 1-4939-3222-5 / 1493932225 |
ISBN-13 | 978-1-4939-3222-1 / 9781493932221 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich