"This book is interesting and well-written. The research methods were explained clearly and conclusions were summarized nicely. It is a relatively quick read at only 130 pages. Anyone who has been told, or who has told others, that mathematicians make better thinkers should read this book." MAA Reviews "The authors particularly attend to protecting positive correlations against the self-selection interpretation, merely that logical minds elect studying more mathematics. Here, one finds a stimulating survey of the systemic difficulties people have with (...) basic syllogisms and deductions." CHOICE connect "The authors particularly attend to protecting positive correlations against the self-selection interpretation, merely that logical minds elect studying more mathematics. Here, one finds a stimulating survey of the systemic difficulties people have with basic syllogisms and deductions." CHOICE Connect For centuries, educational policymakers have believed that studying mathematics is important, in part because it develops general thinking skills that are useful throughout life. This 'Theory of Formal Discipline' (TFD) has been used as a justification for mathematics education globally. Despite this, few empirical studies have directly investigated the issue, and those which have showed mixed results. Does Mathematical Study Develop Logical Thinking? describes a rigorous investigation of the TFD. It reviews the theory's history and prior research on the topic, followed by reports on a series of recent empirical studies. It argues that, contrary to the position held by sceptics, advanced mathematical study does develop certain general thinking skills, however these are much more restricted than those typically claimed by TFD proponents. Perfect for students, researchers and policymakers in education, further education and mathematics, this book provides much needed insight into the theory and practice of the foundations of modern educational policy. (shrink)

What is argumentation? -- Building a classroom culture of argumentation -- Structuring classroom discussions to focus on argumentation -- Infusing all instruction with argumentation -- Argumentation for all students -- Argumentation and the mathematical practices -- Technology in teaching and learning argumentation -- Assessing argumentation and proof -- Conclusion.

Collectively these essays inform educators and researchers at different grade levels about the teaching and learning of proof at each level and, thus, help ...

Ordinary textbooks for such a course are purely mathematical in their nature, and students usually find the course difficult, boring and very technical. Our approach motivates the students through reading the classic novel Alice's Adventures in Wonderland, written by Lewis Caroll who was not only one of the best storytellers but also a logician.

Mathematical argument in the elementary grades : what and why? -- Elementary students as mathematicians -- The teaching model -- Using the lesson sequences : what the teacher does -- Mathematical argument in the elementary classroom : impact on students and teachers.

One effect of information technology is the increasing need to present information visually. The trend raises intriguing questions. What is the logical status of reasoning that employs visualization? What are the cognitive advantages and pitfalls of this reasoning? What kinds of tools can be developed to aid in the use of visual representation? This newest volume on the Studies in Logic and Computation series addresses the logical aspects of the visualization of information. The authors of these specially commissioned papers explore (...) the properties of diagrams, charts, and maps, and their use in problem solving and teaching basic reasoning skills. As computers make visual representations more commonplace, it is important for professionals, researchers and students in computer science, philosophy, and logic to develop an understanding of these tools; this book can clarify the relationship between visuals and information. (shrink)

Based on extensive research conducted by the authors, Reasoning and Sense Making in the Mathematics Classroom, Pre-K-Grade 2, is designed to help classroom teachers understand, monitor, and guide the development of students' reasoning and sense making about core ideas in elementary school mathematics. It describes and illustrates the nature of these skills using classroom vignettes and actual student work in conjunction with instructional tasks and learning progressions to show how reasoning and sense making develop and how instruction can support students (...) in that development. Students who can make sense of mathematical ideas can apply those ideas in problem solving, even in unfamiliar situations, and can use them as a foundation for future learning. Without them, students are reduced to rote learning, often experiencing frustration and failure. But what do reasoning and sense making during learning and teaching look like? Each chapter of Reasoning and Sense Making in the Mathematics Classroom, Pre-K-Grade 2 explores a different topic that young children encounter in mathematics, demonstrating with actual student work and classroom dialogue how their mathematical knowledge and reasoning ability move through "levels of sophistication" or learning progressions: After opening with a discussion of the nature of reasoning and sense making and their critical importance in developing mathematical thinking, chapter 1 examines how young students attempt to make sense of the concepts of place value and length measurement. Chapter 2 focuses on how early childhood instruction can engage students in mathematical reasoning while helping them construct a rich sense of number and operations. Chapter 3 identifies core algebraic ideas and shows how students can engage with these ideas in ways that not only deepen their understanding of arithmetic but also lays the foundation for the future study of algebra. Children's reasoning and sense making as they decompose and compose geometric shapes--including reasoning about area--is examined in chapter 4. The use of learning progressions to understand students' reasoning and to guide their sense making with appropriate teaching is also discussed. Not just a theoretical discussion, the book also provides specific suggestions for related instructional activities for each topic. Supplementary online resources can be accessed at NCTM's More4U website. Reasoning and Sense Making in the Mathematics Classroom, Pre-K-Grade 2 will be a valuable and practical addition to your professional library. (shrink)

When it’s time for a game change, you need a guide to the new rules. Helping Students Make Sense of the World Using Next Generation Science and Engineering Practices provides a play-by-play understanding of the practices strand of A Framework for K–12 Science Education (Framework) and the Next Generation Science Standards (NGSS). Written in clear, nontechnical language, this book provides a wealth of real-world examples to show you what’s different about practice-centered teaching and learning at all grade levels. The (...) book addresses three important questions: 1. How will engaging students in science and engineering practices help improve science education? 2. What do the eight practices look like in the classroom? 3. How can educators engage students in practices to bring the NGSS to life? Helping Students Make Sense of the World Using Next Generation Science and Engineering Practices was developed for K–12 science teachers, curriculum developers, teacher educators, and administrators. Many of its authors contributed to the Framework’s initial vision and tested their ideas in actual science classrooms. If you want a fresh game plan to help students work together to generate and revise knowledge—not just receive and repeat information—this book is for you. (shrink)

The IOth International Congress of Logic, Methodology and Philosophy of Science, which took place in Florence in August 1995, offered a vivid and comprehensive picture of the present state of research in all directions of Logic and Philosophy of Science. The final program counted 51 invited lectures and around 700 contributed papers, distributed in 15 sections. Following the tradition of previous LMPS-meetings, some authors, whose papers aroused particular interest, were invited to submit their works for publication in a collection of (...) selected contributed papers. Due to the large number of interesting contributions, it was decided to split the collection into two distinct volumes: one covering the areas of Logic, Foundations of Mathematics and Computer Science, the other focusing on the general Philosophy of Science and the Foundations of Physics. As a leading choice criterion for the present volume, we tried to combine papers containing relevant technical results in pure and applied logic with papers devoted to conceptual analyses, deeply rooted in advanced present-day research. After all, we believe this is part of the genuine spirit underlying the whole enterprise of LMPS studies. (shrink)

The book is a collection of the author’s selected works in the philosophy and history of logic and mathematics. Papers in Part I include both general surveys of contemporary philosophy of mathematics as well as studies devoted to specialized topics, like Cantor's philosophy of set theory, the Church thesis and its epistemological status, the history of the philosophical background of the concept of number, the structuralist epistemology of mathematics and the phenomenological philosophy of mathematics. Part II contains essays in the (...) history of logic and mathematics. They address such issues as the philosophical background of the development of symbolism in mathematical logic, Giuseppe Peano and his role in the creation of contemporary logical symbolism, Emil L. Post's works in mathematical logic and recursion theory, the formalist school in the foundations of mathematics and the algebra of logic in England in the 19th century. The history of mathematics and logic in Poland is also considered.This volume is of interest to historians and philosophers of science and mathematics as well as to logicians and mathematicians interested in the philosophy and history of their fields. (shrink)

Mathematics often seems incomprehensible, a melee of strange symbols thrown down on a page. But while formulae, theorems, and proofs can involve highly complex concepts, the math becomes transparent when viewed as part of a bigger picture. What Is a Number? provides that picture. Robert Tubbs examines how mathematical concepts like number, geometric truth, infinity, and proof have been employed by artists, theologians, philosophers, writers, and cosmologists from ancient times to the modern era. Looking at a broad range of (...) topics -- from Pythagoras's exploration of the connection between harmonious sounds and mathematical ratios to the understanding of time in both Western and pre-Columbian thought -- Tubbs ties together seemingly disparate ideas to demonstrate the relationship between the sometimes elusive thought of artists and philosophers and the concrete logic of mathematicians. He complements his textual arguments with diagrams and illustrations. This historic and thematic study refutes the received wisdom that mathematical concepts are esoteric and divorced from other intellectual pursuits -- revealing them instead as dynamic and intrinsic to almost every human endeavor. (shrink)

This book focuses on logic and logical language. It examines different types of words, terms and propositions in detail. While discussing the nature of propositions, it illustrates the procedures used to determine the truth and falsity of a proposition, and the validity and invalidity of an argument. In addition, the book provides a clear exposition of the pure and mixed form of syllogism with suitable examples. The book encompasses sentential logic, predicate logic, symbolic logic, induction and set theory topics. (...) The book is designed to serve all those involved in teaching and learning courses on logic. It offers a valuable resource for students and researchers in philosophy, mathematics and computer science disciplines. Given its scope, it is an essential read for everyone interested in logic, language, formulation of the hypotheses for the scientific enquiries and research studies, and judging valid and invalid arguments in the natural language discourse. (shrink)

This book's activities highlight the important cycle of exploration, conjecture, and justification in all five mathematical strands. Students recognize patterns and make conjectures, learn the value of a counterexample, explore the strengths and weaknesses of visual proofs, discover the power of algebraic representations, and learn that theoretical approaches can substantiate empirical results. The supplemental CD-ROM features interactive electronic activities, master copies of activity pages for students, and additional readings for teachers. --publisher description.

This volume brings together a collection of papers covering a wide range of topics in computer and cognitive science. Topics included are: the foundational relevance of logic to computer science, with particular reference to tense logic, constructive logic, and Horn clause logic; logic as the theoretical underpinnings of the engineering discipline of expert systems; a discussion of the evolution of computational linguistics into functionally distinct task levels; and current issues in the implementation of speech act theory.

Filling the need for an accessible, carefully structured introductory text in symbolic logic, Modern Logic has many features designed to improve students' comprehension of the subject, including a proof system that is the same as the award-winning computer program MacLogic, and a special appendix that shows how to use MacLogic as a teaching aid. There are graded exercises at the end of each chapter--more than 900 in all--with selected answers at the end of the book. Unlike competing texts, (...) Modern Logic gives equal weight to semantics and proof theory and explains their relationship, and develops in detail techniques for symbolizing natural language in first-order logic. After a general introduction featuring the notion of logical form, the book offers sections on classical sentential logic, monadic predicate logic, and full first-order logic with identity. A concluding section deals with extensions of and alternatives to classical logic, including modal logic, intuitionistic logic, and fuzzy logic. For students of philosophy, mathematics, computer science, or linguistics, Modern Logic provides a thorough understanding of basic concepts and a sound basis for more advanced work. (shrink)

This is an introduction for readers with some basic knowledge of logic to contemporary logical analyses of information flow and multi-agent activity with an emphasis on new perspectives and new research directions. The first major topic are dynamic-epistemic logics for analyzing information dynamics and information update based on new observations, as well as the induced processes of knowledge change and belief revision. The second part of the book connects these dynamic-epistemic logics to richer mathematical models coming from dependence logic, (...) topology and probability. In a third and final part, all these systems are brought to bear on the study of agency in games, bringing together logics for analyzing games and games for analyzing logics in one perspective. An appendix discusses a recent view on how qualitative logical and quantitative arithmetical approaches to reasoning can live together and inform each other. A further appendix summarizes the background in modal logic that is needed for this course. (shrink)

This collection is the first anthology of works on Boole.

In addition to a somewhat detailed exposition of certain portions of what may be called the book-work of formal logic, the following pages contain a number of problems worked out in detail and unsolved problems, by means of which the student may test his command over logical processes. In the expository portions of Parts I, II, and III, dealing respectively with terms, propositions, and syllogisms, the traditional lines are in the main followed, though with certain modifications; e.g., in the systematisation (...) of immediate inferences, and in several points of detail in connexion with the syllogism. For purposes of illustration Euler's diagrams are employed to a greater extent than is usual in English manuals. In Part IV, which contains a generalisation of logical processes in their application to complex inferences, a somewhat new departure is taken. So far as I am aware this part constitutes the first systematic attempt that has been made to deal with formal reasonings of the most complicated character without the aid of mathematical or other symbols of operation, and without abandoning the ordinary non-equational or predicative form of proposition. This attempt has on the whole met with greater success than I had anticipated; and I believe that the methods formulated will be found to be both as easy and as effective as the symbolical methods of Boole and his followers. The book concludes with a general and sure method of solution of what Professor Jevons called the inverse problem, and which he himself seemed to regard as soluble only by a series of guesses. (shrink)

First published in the most ambitious international philosophy project for a generation; the _Routledge Encyclopedia of Philosophy_. _Logic from A to Z_ is a unique glossary of terms used in formal logic and the philosophy of mathematics. Over 500 entries include key terms found in the study of: * Logic: Argument, Turing Machine, Variable * Set and model theory: Isomorphism, Function * Computability theory: Algorithm, Turing Machine * Plus a table of logical symbols. Extensively cross-referenced to help comprehension and (...) add detail, _Logic from A to Z_ provides an indispensable reference source for students of all branches of logic. (shrink)

Having studied mathematics, in particular foundations and philosophy of mathematics, it happened that I was asked to teach logic to the students in the Faculty of Philosophy of the Radboud University Nijmegen. It was there that I discovered that logic is much more than just a mathematical discipline consisting of definitions, theorems and proofs, and that logic can and should be embedded in a philosophical context. After ten years of teaching logic at the Faculty of Philosophy at the (...) Radboud University Nijmegen, thirty years at the Faculty of Philosophy of Tilburg University and nine years at the Faculty of Philosophy of the Erasmus University Rotterdam, I got many ideas how to improve my LOGIC book which was published twenty five years ago in 1993 by Verlag Peter Lang. Although the amount of work was enormous, I felt I should do it. It is like working on a large painting where you put some extra color in one corner, add a little detail at another place, shed some more light on a particular face, etc. (shrink)

The study of logic goes back more than two thousand years and in that time many symbols and diagrams have been devised. Around 300 BC Aristotle introduced letters as term-variables, a "new and epoch-making device in logical technique." (W. & M. Kneale The Development of Logic (1962, p. 61). The modern era of mathematical notation in logic began with George Boole (1815- 1864), although none of his notation survives. Set theory came into being in the late 19th and (...) early 20th centuries, largely a creation of Georg Cantor (1845-1918). See MacTutor's A history of set theory or, for more detail, Set theory from the Stanford Encyclopedia of Philosophy. (shrink)

The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative (...) accounts, it appears as a necessary prerequisite to first possess a clear picture of what the deviation of mathematical proof from formal proof consists in. The present work aims to contribute building such a picture by investigating the relation between the elementary steps of deduction constituting the two types of proofs—mathematical inference and logical inference. Many claims have been made in the literature regarding the relation between mathematical inference and logical inference, most of them stating that the former is lacking properties that are constitutive of the latter. Such differentiating claims are, however, usually put forward without a clear conception of the properties occurring in them, and are generally considered to be immediately justified by our direct acquaintance, or phenomenological experience, with the two types of inferences. The present study purports to advance our understanding of the relation between mathematical inference and logical inference by developing a detailed philosophical analysis of the differentiating claims, that is, an analysis of the meaning of the differentiating claims—through the properties that occur in them—as well as the reasons that support them. To this end, we provide at the outset a representative list of the different properties of logical inference that have occurred in the differentiating claims, and we notice that they all boil down to the three properties of formality, generality, and mechanicality. For each one of these properties, our analysis proceeds in two steps: we first provide precise conceptual characterizations of the different ways logical inference has been said to be formal, general, and mechanical, in the philosophical and logical literature on formal proof; we then examine why mathematical inference does not appear to be formal, general, and mechanical, for the different variations of these notions identified. Our study results in a precise conceptual apparatus for expressing and discussing the properties differentiating mathematical inference from logical inference, and provides a first inventory of the various reasons supporting the observations of those differences. The differentiating claims constitute thus a set of data that any philosophical account of mathematical inference and proof purporting to be more faithful to mathematical practice ought to be able to accommodate and explain. (shrink)

Depending on what one means by the main connective of logic, the -if..., then... -, several systems of logic result: classic and modal logics, intuitionistic logic or relevance logic. This book presents the underlying ideas, the syntax and the semantics of these logics. Soundness and completeness are shown constructively and in a uniform way. Attention is paid to the interdisciplinary role of logic: its embedding in the foundations of mathematics and its intimate connection with philosophy, in particular the philosophy of (...) language. Set theory is presented both as a conditio sine qua non for logic and as a interesting exact ontology. The study of infinite sets yields perplexing results. Formalization of informal number theory results in formal number theory; Godel's incompleteness is treated. At appropriate places attention is paid to paradoxes, intuitionism, conditionals, the historical development of logic, to logic programming and automated theorem proving for classical logic.". (shrink)

A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical (...) logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study. (shrink)

Graduate-level historical study is ideal for students intending to specialize in the topic, as well as those who only need a general treatment. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics, emphasizing Hilbert’s metamathematics. Part III focuses on the philosophy of mathematics. Each chapter has extensive supplementary notes; a detailed appendix charts modern developments.

Topics covered in Discrete Mathematics have become essential tools in many areas of studies in recent years. This is primarily due to the revolution in technology, communications, and cyber security. The book treats major themes in a typical introductory modern Discrete Mathematics course: Propositional and predicate logic, proof techniques, set theory (including Boolean algebra, functions and relations), introduction to number theory, combinatorics and graph theory. An accessible, precise, and comprehensive approach is adopted in the treatment of each topic. The ability (...) of abstract thinking and the art of writing valid arguments are emphasized through detailed proof of (almost) every result. Developing the ability to think abstractly and roguishly is key in any areas of science, information technology and engineering. Every result presented in the book is followed by examples and applications to consolidate its comprehension. The hope is that the reader ends up developing both the abstract reasoning as well as acquiring practical skills. All efforts are made to write the book at a level accessible to first-year students and to present each topic in a way that facilitates self-directed learning. Each chapter starts with basic concepts of the subject at hand and progresses gradually to cover more ground on the subject. Chapters are divided into sections and subsections to facilitate readings. Each section ends with its own carefully chosen set of practice exercises to reenforce comprehension and to challenge and stimulate readers. As an introduction to Discrete Mathematics, the book is written with the smallest set of prerequisites possible. Familiarity with basic mathematical concepts (usually acquired in high school) is sufficient for most chapters. However, some mathematical maturity comes in handy to grasp some harder concepts presented in the book. (shrink)

Long ago, when Alexander the Great asked the mathematician Menaechmus for a crash course in geometry, he got the famous reply ``There is no royal road to mathematics.'' Where there was no shortcut for Alexander, there is no shortcut for us. Still, the fact that we have access to computers and mature programming languages means that there are avenues for us that were denied to the kings and emperors of yore. The purpose of this book is to teach logic and (...) mathematical reasoning in practice, and to connect logical reasoning with computer programming in Haskell. Haskell emerged in the 1990s as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvelous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures. This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book, the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others. This is the updated, expanded, and corrected second edition of a much-acclaimed textbook. Praise for the first edition: 'Doets and van Eijck's ``The Haskell Road to Logic, Maths and Programming'' is an astonishingly extensive and accessible textbook on logic, maths, and Haskell.' Ralf Laemmel, Professor of Computer Science, University of Koblenz-Landau. (shrink)

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The (...) most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:The Logic Pamphlets of Charles Lutwidge Dodgson and Related PiecesIrving H. AnellisFrancine F. Abeles, editor. The Logic Pamphlets of Charles Lutwidge Dodgson and Related Pieces. The Pamphlets of Lewis Carroll, 4. New York-Charlottesville-London: Lewis Carroll Society of North America-University Press of Virginia, 2010. Pp. xx + 271. Cloth, $75.00.Until William Bartley’s rediscovery and reconstruction of Dodgson’s lost Part II of Symbolic Logic, Lewis Carroll’s reputation in logic, (...) when taken seriously, rested upon his few published articles on logical paradoxes and puzzles, while his published books, The Game of Logic and Symbolic Logic, were regarded as suitable perhaps as pedagogical tools, but dismissed otherwise as amusements, on a par with the Alice works. Richard Braithwaite asserted (“Lewis Carroll as Logician”) that “Carroll regarded formal and symbolic logic not as a corpus of systematic knowledge about valid thought nor yet as an art for teaching a person to think correctly.” He suggested that Dodgson used his pseudonym for his popular and whimsical writings, reserving his legal name only for his serious mathematical products. Philosophers practicing linguistic analysis in their assault on nonsense deriving from misuse of language meanwhile developed an interest in Carroll (e.g. George Pitcher, “Wittgenstein, Nonsense, and Lewis Carroll”). Abeles, on the contrary, stresses the seriousness of Dodgson’s pedagogical and popularizing mission (195–99).Bartley’s discovery opened the door for reevaluating Dodgson as a serious logician, and Abeles has been in the forefront of that reevaluation. Her general introduction and introductions to the main divisions of this collection of Carroll’s publications (and additional material from his Nachlass and a handful of publications of others, composed in response to Carroll’s published articles) place his serious logical work and its significance in historical perspective, providing a deeper, more sophisticated view than found in Bartley’s “Editor’s Introduction” to Lewis Carroll’s Symbolic Logic. Abeles also offers brief introductions to the individual entries, which describe their physical characteristics and circumstances of composition.Dodgson aligned with the majority of those British logicians of his day, starting with George Boole, who understood formal logic to be Aristotelian syllogistic, and symbolic logic to be syllogistic logic expressed algebraically. His notational innovation was employing indices to terms so that, independently of the arrangement of terms, propositions could easily be read; thus, “xy0” can be read as “no x are y” or “no y are x” and “x1y0” as “all x are not y” or “no x are y”. In dealing with the classical elimination problem in the class calculus—to determine the maximum information, without duplications, obtainable from a given set of premises—Dodgson in his later work and unpublished letters anticipated several concepts of automated theorem proving.Central to both geometry and to formal logic are the rules of logical inference that establish the validity of arguments and guarantee that conclusions inferred from true [End Page 506] premises are true. The modern analytic tableaux, or tree method, is a fundamental tool in this regard, both for deriving theorems and for determining the validity or invalidity of the proofs for propositional calculus and first-order predicate calculus.Introducing his reconstruction of Part II of Symbolic Logic, Bartley noted that, along with the logic diagrams that Carroll devised, he also devised a tableau method that strongly resembled Beth’s semantic tableaux. Abeles went more deeply and convincingly into that resemblance in her earlier research. Beth’s tableaux, together with Hintikka’s model sets, were the direct ancestors of Smullyan’s analytic tableaux, which in turn are the theoretical basis for the Robinson resolution method that continues to be central to much work in programming logic.Abeles has also shown that the work in Studies in Logic by Charles Peirce and his logic students at Johns Hopkins University served as a source of inspiration for Dodgson. More critically, she demonstrated that Dodgson devised and employed the tree method for carrying out proofs of syllogisms and chains of syllogisms, or soriteses, in Part II of Symbolic Logic (see her “Lewis Carroll’s Method of Trees: Its Origins in Studies in Logic,” Modern Logic 1 [1990]: 25–34). The tree... (shrink)

Employing Searle’s views, I begin by arguing that students of Mathematics behave similarly to machines that manage symbols using a set of rules. I then consider two types of Mathematics, which I call Cognitive Mathematics and Technical Mathematics respectively. The former type relates to concepts and meanings, logic and sense, whilst the latter relates to algorithms, heuristics, rules and application of various techniques. I claim that an upgrade in the school teaching of Cognitive Mathematics is necessary. The aim is (...) to change the current mentality of the stakeholders so as to compensate for the undue value presently attached to Technical Mathematics, due to advances in technology and its applications, and thus render the two sides of Mathematics equal. Furthermore, I suggest a reorganization/systematization of School Mathematics into a cognitive network to facilitate students’ understanding of the subject. The final goal is the transition from mechanical execution of rules to better understanding and in-depth knowledge of Mathematics. (shrink)

Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical (...) mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage. The second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging. This book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students in relevant disciplines. (shrink)

Undergraduate students with no prior classroom instruction in mathematical logic will benefit from this evenhanded multipart text by one of the centuries greatest authorities on the subject. Part I offers an elementary but thorough overview of mathematical logic of first order. The treatment does not stop with a single method of formulating logic; students receive instruction in a variety of techniques, first learning model theory (truth tables), then Hilbert-type proof theory, and proof theory handled through derived rules. Part (...) II supplements the material covered in Part I and introduces some of the newer ideas and the more profound results of logical research in the twentieth century. Subsequent chapters introduce the study of formal number theory, with surveys of the famous incompleteness and undecidability results of Godel, Church, Turing, and others. The emphasis in the final chapter reverts to logic, with examinations of Godel's completeness theorem, Gentzen's theorem, Skolem's paradox and nonstandard models of arithmetic, and other theorems. Unabridged republication of the edition published by John Wiley & Sons, Inc. New York, 1967. Preface. Bibliography. Theorem and Lemma Numbers: Pages. List of Postulates. Symbols and Notations. Index. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts (...) continue, but have been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

Many philosophers have considered logical reasoning as an inborn ability of mankind and as a distinctive feature in the human mind; but we all know that the distribution of this capacity, or at any rate its development, is very unequal. Few people are able to set up a cogent argument; others are at least able to follow a logical argument and even to detect logical fallacies. Nevertheless, even among educated persons there are many who do not even attain this relatively (...) modest level of development. According to my personal observations, lack of logical ability may be due to various circumstances. In the first place, I mention lack of general intelligence, insufficient power of concentration, and absence of formal education. Secondly, however, I have noticed that many people are unable, or sometimes rather unwilling, to argue ex hypothesi; such persons cannot, or will not, start from premisses which they know or believe to be false or even from premisses whose truth is not, in their opinion, sufficient ly warranted. Or, if they agree to start from such premisses, they sooner or later stray away from the argument into attempts first to settle the truth or falsehood of the premisses. Presumably this attitude results either from lack of imagination or from undue moral rectitude. On the other hand, proficiency in logical reasoning is not in itself a guarantee for a clear theoretic insight into the principles and foundations of logic. (shrink)

Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic. At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics. Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of (...) a derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations. Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved. Optinal sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch. Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches. Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in logic, mathematics, philosophy, and computer science. (shrink)

Science and mathematics continually change in their tools, methods, and concepts. Many of these changes are not just modifications but progress---steps to be admired. But what constitutes progress? This dissertation addresses one central source of intellectual advancement in both disciplines: reformulating a problem-solving plan into a new, logically compatible one. For short, I call these cases of compatible problem-solving plans "reformulations." Two aspects of reformulations are puzzling. First, reformulating is often unnecessary. Given that we could already solve a problem using (...) an older formulation, what do we gain by reformulating? Second, some reformulations are genuinely trivial or insignificant. Merely replacing one symbol with another does not lead to intellectual progress. What distinguishes significant reformulations from trivial ones? According to what I call "conceptualism" (or "conceptual empiricism"), reformulations are intellectually significant when they provide a different plan for solving problems. Significant reformulations provide inferentially different routes to the same solution. In contrast, trivial reformulations provide exactly the same problem-solving plans, and hence they do not change our understanding. This answers the second question about what distinguishes trivial from significant reformulations. However, the first question remains: what makes a new way of solving an old problem valuable? Here, a bevy of practical considerations come to mind: one formulation might be faster, less complicated, or use more familiar concepts. According to "instrumentalism," these practical benefits are all there is to reformulating. Some reformulations are simply more instrumentally valuable for meeting the aims of science than others. At another extreme, "fundamentalism" contends that a reformulation is valuable when it provides a more fundamental description of reality. According to this view, some reformulations directly contribute to the metaphysical aim of carving reality at its joints. Conceptualism develops a middle ground between instrumentalism and fundamentalism, preserving their benefits without their costs. I argue that the epistemic value of significant reformulations does not reduce to either practical or metaphysical value. Reformulations are valuable because they are a constitutive part of problem-solving. Both science and mathematics aim at solving all possible problems within their respective domains. Meeting this aim requires being able to plan for any possible problem-solving context, and this requires reformulating. By reformulating, we clarify what we need to know to solve problems. Still, one might wonder whether the value of reformulations requires underlying differences in explanatory power. According to "explanationism," a reformulation is valuable only when it provides a better explanation. Explanationism stands as a rival middle ground position to my own. However, it faces numerous counterexamples. In many cases, two reformulations provide the same explanation while nonetheless providing different ways of understanding a phenomenon. Hence, reformulating can be valuable even when neither formulation is more explanatory. Methodologically, I draw on a variety of case studies to support my account of reformulation. These range from classical mechanics to quantum chemistry, along with examples from mathematics. Symmetry arguments provide a paradigmatic example: the mathematics of symmetry groups radically recasts quantum mechanics and quantum chemistry. Nevertheless, elementary approaches exist that eschew this additional mathematical apparatus, solving problems in a more tedious but less mathematically-demanding manner. Further examples include reformulations of quantum field theory, Arabic vs. Roman numerals, and Fermat's little theorem in number theory. In each case, my account identifies how reformulations change and improve our understanding of science and mathematics. (shrink)

It is a fact of modern scientific thought that there is an enormous variety of logical systems - such as classical logic, intuitionist logic, temporal logic, and Hoare logic, to name but a few - which have originated in the areas of mathematical logic and computer science. In this book the author presents a systematic study of this rich harvest of logics via Tarski's well-known axiomatization of the notion of logical consequence. New and sometimes unorthodox treatments are given (...) of the underlying principles and construction of many-valued logics, the logic of inexactness, effective logics, and modal logics. Throughout, numerous historical and philosophical remarks illuminate both the development of the subject and show the motivating influences behind its development. Those with a modest acquaintance of modern formal logic will find this to be a readable and not too technical account which will demonstrate the current diversity and profusion of logics. In particular, undergraduate and postgraduate students in mathematics, philosophy, computer science, and artificial intelligence will enjoy this introductory survey of the field. (shrink)

This book is intended for mathematicians. Its origins lie in a course of lectures given by an algebraist to a class which had just completed a sub stantial course on abstract algebra. Consequently, our treatment ofthe sub ject is algebraic. Although we assurne a reasonable level of sophistication in algebra, the text requires little more than the basic notions of group, ring, module, etc. A more detailed knowledge of algebra is required for some of . the exercises. We also assurne (...) a familiarity with the main ideas of set theory, including cardinal numbers and Zorn's Lemma. In this book, we carry out a mathematical study of the logic used in mathematics. We do this by constructing a mathematical model oflogic and applying mathematics to analyse the properties of the model. We therefore regard all our existing knowledge of mathematics as being applicable to the analysis of the model, and in particular we accept set theory as part of the meta-Ianguage. We are not attempting to construct a foundation on which all mathematics is to be based-rather, any conclusions to be drawn about the foundations of mathematics co me only by analogy with the model, and are to be regarded in much the same way as the conclusions drawn from any scientific theory. (shrink)

This comprehensive intro text covers central topics of elementary and symbolic logic. It contains many problems and exercises and provides a solid foundation for continued study of advanced topics in logic.

Designed to provide a firm foundation in mathematical logic, this work aims to serve as an elementary textbook for both graduate study and for applications of logic, such as logic programming and format specification and verification.