A Spiral Workbook for Discrete Mathematics


Book Description

A Spiral Workbook for Discrete Mathematics covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions,relations, and elementary combinatorics, with an emphasis on motivation. The text explains and claries the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a nal polished form. Hands-on exercises help students understand a concept soon after learning it. The text adopts a spiral approach: many topics are revisited multiple times, sometimes from a dierent perspective or at a higher level of complexity, in order to slowly develop the student's problem-solving and writing skills.




Discrete Mathematics


Book Description

Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.




Induction and Example


Book Description

Very little work has been done on the function of example as a rhetorical induction in the New Testament. This lacuna in scholarship is particularly striking given Paul's personal (rhetorical) examples in his Letter to the Galatians. In Induction and Example, C. T. Johnson, therefore, addresses a much needed area of Pauline research. Johnson first constructs a methodology to assist readers in interpreting and identifying Aristotle's induction and the rhetorical example, and then using this methodology, he focuses on Paul's personal (and rhetorical) examples to get at "the truth of the gospel" in the letter to the Galatians. The monograph defines and describes two aspects of induction (observation and experience) and how they function in the biblical text, especially how individuals arrive at their inductive conclusions. Further still, Johnson describes how the various types of example--historical, recent, personal, and analogical--are used as rhetorical devices to persuade a person, or community to embrace or reject a particular position in the future. Induction and Example is essential reading not only for scholars and students of New Testament rhetoric, but also for anyone interested in the ways in which the apostle Paul communicated personally and persuasively to the early churches under his influence.




Applied Discrete Structures


Book Description

Applied Discrete Structures, is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures. The algebraic structures that are discussed are monoids, groups, rings, fields and vector spaces. Website: http: //discretemath.org Applied Discrete Structures has been approved by the American Institute of Mathematics as part of their Open Textbook Initiative. For more information on open textbooks, visit http: //www.aimath.org/textbooks/. This version was created using Mathbook XML (https: //mathbook.pugetsound.edu/) Al Doerr is Emeritus Professor of Mathematical Sciences at UMass Lowell. His interests include abstract algebra and discrete mathematics. Ken Levasseur is a Professor of Mathematical Sciences at UMass Lowell. His interests include discrete mathematics and abstract algebra, and their implementation using computer algebra systems.




The Logical Leap


Book Description

A groundbreaking solution to the problem of induction, based on Ayn Rand's theory of concepts. Inspired by and expanding on a series of lectures presented by Leonard Peikoff, David Harriman presents a fascinating answer to the problem of induction-the epistemological question of how we can know the truth of inductive generalizations. Ayn Rand presented her revolutionary theory of concepts in her book Introduction to Objectivist Epistemology. As Dr. Peikoff subsequently explored the concept of induction, he sought out David Harriman, a physicist who had taught philosophy, for his expert knowledge of the scientific discovery process. Here, Harriman presents the result of a collaboration between scientist and philosopher. Beginning with a detailed discussion of the role of mathematics and experimentation in validating generalizations in physics-looking closely at the reasoning of scientists such as Galileo, Kepler, Newton, Lavoisier, and Maxwell-Harriman skillfully argues that the inductive method used in philosophy is in principle indistinguishable from the method used in physics.




Understanding Arguments


Book Description

Construct effective arguments with UNDERSTANDING ARGUMENTS: AN INTRODUCTION TO INFORMAL LOGIC, International Edition. Primarily an introduction to informal logic, this text provides a guide to understanding and constructing arguments in the context of academic studies and subsequent professional careers. Exercises, discussion questions, chapter objectives, and readings help clarify difficult concepts and make the material meaningful and useful.




An Aristotelian Account of Induction


Book Description

In An Aristotelian Account of Induction Groarke discusses the intellectual process through which we access the "first principles" of human thought - the most basic concepts, the laws of logic, the universal claims of science and metaphysics, and the deepest moral truths. Following Aristotle and others, Groarke situates the first stirrings of human understanding in a creative capacity for discernment that precedes knowledge, even logic. Relying on a new historical study of philosophical theories of inductive reasoning from Aristotle to the twenty-first century, Groarke explains how Aristotle offers a viable solution to the so-called problem of induction, while offering new contributions to contemporary accounts of reasoning and argument and challenging the conventional wisdom about induction.




The Philosophy Gym


Book Description

Unique and accessible explanations to some of life's biggest questions, obtained through a series of irresistable mental challenges




Reliable Reasoning


Book Description

The implications for philosophy and cognitive science of developments in statistical learning theory. In Reliable Reasoning, Gilbert Harman and Sanjeev Kulkarni—a philosopher and an engineer—argue that philosophy and cognitive science can benefit from statistical learning theory (SLT), the theory that lies behind recent advances in machine learning. The philosophical problem of induction, for example, is in part about the reliability of inductive reasoning, where the reliability of a method is measured by its statistically expected percentage of errors—a central topic in SLT. After discussing philosophical attempts to evade the problem of induction, Harman and Kulkarni provide an admirably clear account of the basic framework of SLT and its implications for inductive reasoning. They explain the Vapnik-Chervonenkis (VC) dimension of a set of hypotheses and distinguish two kinds of inductive reasoning. The authors discuss various topics in machine learning, including nearest-neighbor methods, neural networks, and support vector machines. Finally, they describe transductive reasoning and suggest possible new models of human reasoning suggested by developments in SLT.




A Friendly Introduction to Mathematical Logic


Book Description

At the intersection of mathematics, computer science, and philosophy, mathematical logic examines the power and limitations of formal mathematical thinking. In this expansion of Leary's user-friendly 1st edition, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory. The text is designed to be used either in an upper division undergraduate classroom, or for self study. Updating the 1st Edition's treatment of languages, structures, and deductions, leading to rigorous proofs of Gödel's First and Second Incompleteness Theorems, the expanded 2nd Edition includes a new introduction to incompleteness through computability as well as solutions to selected exercises.