The Mathematician's Toolbox
Author: Robert S. Wolf
Publisher: St. Martin's Press
This text is designed to teach students how to read and write proofs in mathematics and to acquaint them with how mathematicians investigate problems and formulate conjecture.
Author: Luis F. Moreno
Publisher: The Mathematical Association of America
An Invitation to Real Analysis is written both as a stepping stone to higher calculus and analysis courses, and as foundation for deeper reasoning in applied mathematics. This book also provides a broader foundation in real analysis than is typical for future teachers of secondary mathematics. In connection with this, within the chapters, students are pointed to numerous articles from The College Mathematics Journal and The American Mathematical Monthly. These articles are inviting in their level of exposition and their wide-ranging content. Axioms are presented with an emphasis on the distinguishing characteristics that new ones bring, culminating with the axioms that define the reals. Set theory is another theme found in this book, beginning with what students are familiar with from basic calculus. This theme runs underneath the rigorous development of functions, sequences, and series, and then ends with a chapter on transfinite cardinal numbers and with chapters on basic point-set topology. Differentiation and integration are developed with the standard level of rigor, but always with the goal of forming a firm foundation for the student who desires to pursue deeper study. A historical theme interweaves throughout the book, with many quotes and accounts of interest to all readers. Over 600 exercises and dozens of figures help the learning process. Several topics (continued fractions, for example), are included in the appendices as enrichment material. An annotated bibliography is included.
Patterns, Problems, Conjectures, and Proofs
Author: Raymond Nickerson
Publisher: Taylor & Francis
The development of mathematical competence -- both by humans as a species over millennia and by individuals over their lifetimes -- is a fascinating aspect of human cognition. This book explores a vast range of psychological questions related to mathematical cognition, and provides fascinating insights for researchers and students of cognition and instructors of mathematics.
Author: Garrett Birkhoff,Saunders Mac Lane
Publisher: CRC Press
This classic, written by two young instructors who became giants in their field, has shaped the understanding of modern algebra for generations of mathematicians and remains a valuable reference and text for self study and college courses.
An Introduction to Mathematical Proofs
Author: Antonella Cupillari
Publisher: Academic Press
The Nuts and Bolts of Proofs: An Introduction to Mathematical Proofs provides basic logic of mathematical proofs and shows how mathematical proofs work. It offers techniques for both reading and writing proofs. The second chapter of the book discusses the techniques in proving if/then statements by contrapositive and proofing by contradiction. It also includes the negation statement, and/or. It examines various theorems, such as the if and only-if, or equivalence theorems, the existence theorems, and the uniqueness theorems. In addition, use of counter examples, mathematical induction, composite statements including multiple hypothesis and multiple conclusions, and equality of numbers are covered in this chapter. The book also provides mathematical topics for practicing proof techniques. Included here are the Cartesian products, indexed families, functions, and relations. The last chapter of the book provides review exercises on various topics. Undergraduate students in engineering and physical science will find this book invaluable. Jumps right in with the needed vocabulary—gets students thinking like mathematicians from the beginning Offers a large variety of examples and problems with solutions for students to work through on their own Includes a collection of exercises without solutions to help instructors prepare assignments Contains an extensive list of basic mathematical definitions and concepts needed in abstract mathematics
Author: Connie M. Campbell
Publisher: Cengage Learning
This text offers a crucial primer on proofs and the language of mathematics. Brief and to the point, it lays out the fundamental ideas of abstract mathematics and proof techniques that students will need to master for other math courses. Campbell presents these concepts in plain English, with a focus on basic terminology and a conversational tone that draws natural parallels between the language of mathematics and the language students communicate in every day. The discussion highlights how symbols and expressions are the building blocks of statements and arguments, the meanings they convey, and why they are meaningful to mathematicians. In-class activities provide opportunities to practice mathematical reasoning in a live setting, and an ample number of homework exercises are included for self-study. This text is appropriate for a course in Foundations of Advanced Mathematics taken by students who've had a semester of calculus, and is designed to be accessible to students with a wide range of mathematical proficiency. It can also be used as a self-study reference, or as a supplement in other math courses where additional proofs practice is needed. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
Author: R.R. Bowker Company
Category: American literature
Books in print is the major source of information on books currently published and in print in the United States. The database provides the record of forthcoming books, books in-print, and books out-of-print.
The Changing Nature of Mathematical Proof
Author: Steven G. Krantz
Publisher: Springer Science & Business Media
This text explores the many transformations that the mathematical proof has undergone from its inception to its versatile, present-day use, considering the advent of high-speed computing machines. Though there are many truths to be discovered in this book, by the end it is clear that there is no formalized approach or standard method of discovery to date. Most of the proofs are discussed in detail with figures and equations accompanying them, allowing both the professional mathematician and those less familiar with mathematics to derive the same joy from reading this book.
A Companion to Undergraduate Mathematics
Author: Kevin Houston
Publisher: Cambridge University Press
Looking for a head start in your undergraduate degree in mathematics? Maybe you've already started your degree and feel bewildered by the subject you previously loved? Don't panic! This friendly companion will ease your transition to real mathematical thinking. Working through the book you will develop an arsenal of techniques to help you unlock the meaning of definitions, theorems and proofs, solve problems, and write mathematics effectively. All the major methods of proof - direct method, cases, induction, contradiction and contrapositive - are featured. Concrete examples are used throughout, and you'll get plenty of practice on topics common to many courses such as divisors, Euclidean algorithms, modular arithmetic, equivalence relations, and injectivity and surjectivity of functions. The material has been tested by real students over many years so all the essentials are covered. With over 300 exercises to help you test your progress, you'll soon learn how to think like a mathematician.
research, learning and teaching
Author: David Alexander Reid,Christine Knipping
Research on teaching and learning proof and proving has expanded in recent decades. This reflects the growth of mathematics education research in general, but also an increased emphasis on proof in mathematics education. This development is a welcome one for those interested in the topic, but also poses a challenge, especially to teachers and new scholars. It has become more and more difficult to get an overview of the field and to identify the key concepts used in research on proof and proving. This book is intended to help teachers, researchers and graduate students to overcome the difficulty of getting an overview of research on proof and proving. It reviews the key findings and concepts in research on proof and proving, and embeds them in a contextual frame that allows the reader to make sense of the sometimes contradictory statements found in the literature. It also provides examples from current research that explore how larger patterns in reasoning and argumentation provide insight into teaching and learning.
Author: Karine Chemla
Publisher: Cambridge University Press
This radical, profoundly scholarly book explores the purposes and nature of proof in a range of historical settings. It overturns the view that the first mathematical proofs were in Greek geometry and rested on the logical insights of Aristotle by showing how much of that view is an artefact of nineteenth-century historical scholarship. It documents the existence of proofs in ancient mathematical writings about numbers and shows that practitioners of mathematics in Mesopotamian, Chinese and Indian cultures knew how to prove the correctness of algorithms, which are much more prominent outside the limited range of surviving classical Greek texts that historians have taken as the paradigm of ancient mathematics. It opens the way to providing the first comprehensive, textually based history of proof.
The Basic Toolbox
Author: Kurt Mehlhorn,Peter Sanders
Publisher: Springer Science & Business Media
Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java. The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.
Author: Kenneth Kunen
Mathematical logic grew out of philosophical questions regarding the foundations of mathematics, but logic has now outgrown its philosophical roots, and has become an integral part of mathematics in general. This book is designed for students who plan to specialize in logic, as well as for those who are interested in the applications of logic to other areas of mathematics. Used as a text, it could form the basis of a beginning graduate-level course. There are three main chapters: Set Theory, Model Theory, and Recursion Theory. The Set Theory chapter describes the set-theoretic foundations of all of mathematics, based on the ZFC axioms. It also covers technical results about the Axiom of Choice, well-orderings, and the theory of uncountable cardinals. The Model Theory chapter discusses predicate logic and formal proofs, and covers the Completeness, Compactness, and Lowenheim-Skolem Theorems, elementary submodels, model completeness, and applications to algebra. This chapter also continues the foundational issues begun in the set theory chapter. Mathematics can now be viewed as formal proofs from ZFC. Also, model theory leads to models of set theory. This includes a discussion of absoluteness, and an analysis of models such as H( ) and R( ). The Recursion Theory chapter develops some basic facts about computable functions, and uses them to prove a number of results of foundational importance; in particular, Church's theorem on the undecidability of logical consequence, the incompleteness theorems of Godel, and Tarski's theorem on the non-definability of truth.
Author: David H. Bailey,Jonathan Borwein,Neil Calkin,Russell Luke,Roland Girgensohn,Victor Moll
Publisher: CRC Press
With the continued advance of computing power and accessibility, the view that "real mathematicians don't compute" no longer has any traction for a newer generation of mathematicians. The goal in this book is to present a coherent variety of accessible examples of modern mathematics where intelligent computing plays a significant role and in so doing to highlight some of the key algorithms and to teach some of the key experimental approaches.