A Formal Background to Mathematics


Book Description

§1 Faced by the questions mentioned in the Preface I was prompted to write this book on the assumption that a typical reader will have certain characteristics. He will presumably be familiar with conventional accounts of certain portions of mathematics and with many so-called mathematical statements, some of which (the theorems) he will know (either because he has himself studied and digested a proof or because he accepts the authority of others) to be true, and others of which he will know (by the same token) to be false. He will nevertheless be conscious of and perturbed by a lack of clarity in his own mind concerning the concepts of proof and truth in mathematics, though he will almost certainly feel that in mathematics these concepts have special meanings broadly similar in outward features to, yet different from, those in everyday life; and also that they are based on criteria different from the experimental ones used in science. He will be aware of statements which are as yet not known to be either true or false (unsolved problems). Quite possibly he will be surprised and dismayed by the possibility that there are statements which are "definite" (in the sense of involving no free variables) and which nevertheless can never (strictly on the basis of an agreed collection of axioms and an agreed concept of proof) be either proved or disproved (refuted).




Mathematical Logic


Book Description

This book, presented in two parts, offers a slow introduction to mathematical logic, and several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions. Its first part, Logic Sets, and Numbers, shows how mathematical logic is used to develop the number structures of classical mathematics. The exposition does not assume any prerequisites; it is rigorous, but as informal as possible. All necessary concepts are introduced exactly as they would be in a course in mathematical logic; but are accompanied by more extensive introductory remarks and examples to motivate formal developments. The second part, Relations, Structures, Geometry, introduces several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions, and shows how they are used to study and classify mathematical structures. Although more advanced, this second part is accessible to the reader who is either already familiar with basic mathematical logic, or has carefully read the first part of the book. Classical developments in model theory, including the Compactness Theorem and its uses, are discussed. Other topics include tameness, minimality, and order minimality of structures. The book can be used as an introduction to model theory, but unlike standard texts, it does not require familiarity with abstract algebra. This book will also be of interest to mathematicians who know the technical aspects of the subject, but are not familiar with its history and philosophical background.




Mathematical Logic


Book Description




Logic, Sets and Numbers


Book Description







A Formal Background to Mathematics 2a


Book Description




Fundamentals of Mathematics


Book Description

An accessible introduction to abstract mathematics with an emphasis on proof writing Addressing the importance of constructing and understanding mathematical proofs, Fundamentals of Mathematics: An Introduction to Proofs, Logic, Sets, and Numbers introduces key concepts from logic and set theory as well as the fundamental definitions of algebra to prepare readers for further study in the field of mathematics. The author supplies a seamless, hands-on presentation of number systems, utilizing key elements of logic and set theory and encouraging readers to abide by the fundamental rule that you are not allowed to use any results that you have not proved yet. The book begins with a focus on the elements of logic used in everyday mathematical language, exposing readers to standard proof methods and Russell's Paradox. Once this foundation is established, subsequent chapters explore more rigorous mathematical exposition that outlines the requisite elements of Zermelo-Fraenkel set theory and constructs the natural numbers and integers as well as rational, real, and complex numbers in a rigorous, yet accessible manner. Abstraction is introduced as a tool, and special focus is dedicated to concrete, accessible applications, such as public key encryption, that are made possible by abstract ideas. The book concludes with a self-contained proof of Abel's Theorem and an investigation of deeper set theory by introducing the Axiom of Choice, ordinal numbers, and cardinal numbers. Throughout each chapter, proofs are written in much detail with explicit indications that emphasize the main ideas and techniques of proof writing. Exercises at varied levels of mathematical development allow readers to test their understanding of the material, and a related Web site features video presentations for each topic, which can be used along with the book or independently for self-study. Classroom-tested to ensure a fluid and accessible presentation, Fundamentals of Mathematics is an excellent book for mathematics courses on proofs, logic, and set theory at the upper-undergraduate level as well as a supplement for transition courses that prepare students for the rigorous mathematical reasoning of advanced calculus, real analysis, and modern algebra. The book is also a suitable reference for professionals in all areas of mathematics education who are interested in mathematical proofs and the foundation upon which all mathematics is built.




Set Theory And Foundations Of Mathematics: An Introduction To Mathematical Logic - Volume Ii: Foundations Of Mathematics


Book Description

This book provides an introduction to mathematical logic and the foundations of mathematics. It will help prepare students for advanced study in set theory and mathematical logic as well as other areas of mathematics, such as analysis, topology, and algebra. The presentation of finite state and Turing machines leads to the Halting Problem and Gödel's Incompleteness Theorem, which have broad academic interest, particularly in computer science and philosophy.