Notations are central for understanding mathematical discourse. Readers would like to read notations that transport the meaning well and prefer notations that are familiar to them. Therefore, authors optimize the choice of notations with respect to these two criteria, while at the same time trying to remain consistent over the document and their own prior publications. In print media where notations are fixed at publication time, this is an over-constrained problem. In living documents notations can be adapted at reading (...) time, taking reader preferences into account. We present a representational infrastructure for notations in living mathematical documents. Mathematical notations can be defined declaratively. Author and reader can extensionally define the set of available notation definitions at arbitrary document levels, and they can guide the notation selection function via intensional annotations. We give an abstract specification of notation definitions and the flexible rendering algorithms and show their coverage on paradigmatic examples. We show how to use this framework to render OpenMath and Content-MathML to Presentation-MathML, but the approach extends to arbitrary content and presentation formats. We discuss prototypical implementations of all aspects of the rendering pipeline. (shrink)
Notations are central for understanding mathematical discourse. Readers would like to read notations that transport the meaning well and prefer notations that are familiar to them. Therefore, authors optimize the choice of notations with respect to these two criteria, while at the same time trying to remain consistent over the document and their own prior publications. In print media where notations are fixed at publication time, this is an over-constrained problem. In living documents notations can be adapted at reading (...) time, taking reader preferences into account. We present a representational infrastructure for notations in living mathematical documents. Mathematical notations can be defined declaratively. Author and reader can extensionally define the set of available notation definitions at arbitrary document levels, and they can guide the notation selection function via intensional annotations. We give an abstract specification of notation definitions and the flexible rendering algorithms and show their coverage on paradigmatic examples. We show how to use this framework to render OpenMath and Content-MathML to Presentation-MathML, but the approach extends to arbitrary content and presentation formats. We discuss prototypical implementations of all aspects of the rendering pipeline. (shrink)
The instability inherent in the historical inventory of mathematical objects challenges philosophers. Naturalism suggests we can construct enduring answers to ontological questions through an investigation of the processes whereby mathematical objects come into existence. Patterns of historical development suggest that mathematical objects undergo an intelligible process of reification in tandem with notational innovation. Investigating changes in mathematical languages is a necessary first step towards a viable ontology. For this reason, scholars should not modernize historical texts without (...) caution, as the use of anachronistic notation tends to impede, rather than enhance, our ability to recognize the emergent nature of mathematical objects. (shrink)
This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability. The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive (...) class='Hi'>notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory. Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises. Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification. (shrink)
A basic thesis of Neokantian epistemology and philosophy of science contends that the knowing subject and the object to be known are only abstractions. What really exists, is the relation between both. For the elucidation of this “knowledge relation ("Erkenntnisrelation") the Neokantians of the Marburg school used a variety of mathematical metaphors. In this con-tribution I reconsider some of these metaphors proposed by Paul Natorp, who was one of the leading members of the Marburg school. It is shown that (...) Natorp's metaphors are not unrelated to those used in some currents of contemporary epistemology and philosophy of science. (shrink)
The present paper argues that ‘mature mathematical formalisms’ play a central role in achieving representation via scientific models. A close discussion of two contemporary accounts of how mathematical models apply—the DDI account (according to which representation depends on the successful interplay of denotation, demonstration and interpretation) and the ‘matching model’ account—reveals shortcomings of each, which, it is argued, suggests that scientific representation may be ineliminably heterogeneous in character. In order to achieve a degree of unification that is compatible (...) with successful representation, scientists often rely on the existence of a ‘mature mathematical formalism’, where the latter refers to a—mathematically formulated and physically interpreted—notational system of locally applicable rules that derive from (but need not be reducible to) fundamental theory. As mathematical formalisms undergo a process of elaboration, enrichment, and entrenchment, they come to embody theoretical, ontological, and methodological commitments and assumptions. Since these are enshrined in the formalism itself, they are no longer readily obvious to either the novice or the proficient user. At the same time as formalisms constrain what may be represented, they also function as inferential and interpretative resources. (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)
The Löwenheim-Skolem theorem was published in Skolem's long paper of 1920, with the first section dedicated to the theorem. The second section of the paper contains a proof-theoretical analysis of derivations in lattice theory. The main result, otherwise believed to have been established in the late 1980s, was a polynomial-time decision algorithm for these derivations. Skolem did not develop any notation for the representation of derivations, which makes the proofs of his results hard to follow. Such a formal (...) class='Hi'>notation is given here by which these proofs become transparent. A third section of Skolem's paper gives an analysis for derivations in plane projective geometry. To clear a gap in Skolem's result, a new conservativity property is shown for projective geometry, to the effect that a proper use of the axiom that gives the uniqueness of connecting lines and intersection points requires a conclusion with proper cases (logically, a disjunction in a positive part) to be proved. The forgotten parts of Skolem's first paper on the Löwenheim-Skolem theorem are the perhaps earliest combinatorial analyses of formal mathematical proofs, and at least the earliest analyses with profound results. (shrink)
A history of logic -- Patterns of reasoning -- A language and its meaning -- A symbolic language -- 1850-1950 mathematical logic -- Modern symbolic logic -- Elements of set theory -- Sets, functions, relations -- Induction -- Turning machines -- Computability and decidability -- Propositional logic -- Syntax and proof systems -- Semantics of PL -- Soundness and completeness -- First order logic -- Syntax and proof systems of FOL -- Semantics of FOL -- More semantics -- Soundness (...) and completeness -- Why is first order logic "First Order"? (shrink)
Noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. After historical survey, lucid treatment of set theory, model theory, recursion theory and constructivism and proof theory. Place of problems in development of theories of logic, logic’s relationship to computer science, more. Suitable for readers at many levels of mathematical sophistication. 3 appendixes. Bibliography. 1981 edition.
Recent experimental evidence from developmental psychology and cogni- tive neuroscience indicates that humans are equipped with unlearned elementary math- ematical skills. However, formal mathematics has properties that cannot be reduced to these elementary cognitive capacities. The question then arises how human beings cognitively deal with more advanced mathematical ideas. This paper draws on the extended mind thesis to suggest that mathematical symbols enable us to delegate some mathematical operations to the external environment. In this view, mathematical (...) symbols are not only used to express mathematical concepts—they are constitutive of the mathematical concepts themselves. Mathematical symbols are epistemic actions, because they enable us to represent concepts that are literally unthinkable with our bare brains. Using case-studies from the history of mathematics and from educational psychology, we argue for an intimate relationship between mathematical symbols and mathematical cognition. (shrink)
This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a (...) human mathematician, for Turing, was not a computable sequence (i.e., one that could be generated by a Turing machine). Since computers only contained a finite number of instructions (or programs), one might argue, they could not reproduce human intelligence. Turing called this the “mathematical objection” to his view that machines can think. Logico-mathematical reasons, stemming from his own work, helped to convince Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. He felt it should be possible to program a computer so that it could learn or discover new rules, overcoming the limitations imposed by the incompleteness and undecidability results in the same way that human mathematicians presumably do. (shrink)
Proofs and Refutations is essential reading for all those interested in the methodology, the philosophy and the history of mathematics. Much of the book takes the form of a discussion between a teacher and his students. They propose various solutions to some mathematical problems and investigate the strengths and weaknesses of these solutions. Their discussion (which mirrors certain real developments in the history of mathematics) raises some philosophical problems and some problems about the nature of mathematical discovery or (...) creativity. Imre Lakatos is concerned throughout to combat the classical picture of mathematical development as a steady accumulation of established truths. He shows that mathematics grows instead through a richer, more dramatic process of the successive improvement of creative hypotheses by attempts to 'prove' them and by criticism of these attempts: the logic of proofs and refutations. (shrink)
Therefore, the text is divided into three parts: an introduction into mathematical logic (Chapter 1), model theory (Chapters 2 and 3), and the model theoretic ...
It is alleged that the causal inertness of abstract objects and the causal conditions of certain naturalized epistemologies precludes the possibility of mathematical know- ledge. This paper rejects this alleged incompatibility, while also maintaining that the objects of mathematical beliefs are abstract objects, by incorporating a naturalistically acceptable account of ‘rational intuition.’ On this view, rational intuition consists in a non-inferential belief-forming process where the entertaining of propositions or certain contemplations results in true beliefs. This view is free (...) of any conditions incompatible with abstract objects, for the reason that it is not necessary that S stand in some causal relation to the entities in virtue of which p is true. Mathematical intuition is simply one kind of reliable process type, whose inputs are not abstract numbers, but rather, contemplations of abstract numbers. (shrink)
This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.
Comprehensive account of constructive theory of first-order predicate calculus. Covers formal methods including algorithms and epi-theory, brief treatment of Markov’s approach to algorithms, elementary facts about lattices and similar algebraic systems, more. Philosophical and reflective as well as mathematical. Graduate-level course. 1963 ed. Exercises.
Robert Stalnaker has argued that mathematical information is information about the sentences and expressions of mathematics. I argue that this metalinguistic account is open to a variant of Alonzo Church's translation objection and that Stalnaker's attempt to get around this objection is not successful. If correct, this tells not only against Stalnaker's account of mathematical truths, but against any metalinguistic account of truths that are both necessary and informative.
INTRODUCTION In ita original form the present paper was presented to the American Mathematical Society, April 2k,, as a companion piece to the writer's ...
This introduction to rigorous mathematical logic is simple enough in both presentation and context for students of a wide range of ages and abilities. Starting with symbolizing sentences and sentential connectives, it proceeds to the rules of logical inference and sentential derivation, examines the concepts of truth and validity, and presents a series of truth tables. Subsequent topics include terms, predicates, and universal quantifiers; universal specification and laws of identity; axioms for addition; and universal generalization. Throughout the book, the (...) authors emphasize the pervasive and important problem of translating English sentences into logical or mathematical symbolism. 1964 edition. Index. (shrink)
Chihara here develops a mathematical system in which there are no existence assertions but only assertions of the constructibility of certain sorts of things. He utilizes this system in the analysis of the nature of mathematics, and discusses many recent works in the philosophy of mathematics from the viewpoint of the constructibility theory developed. This innovative analysis will appeal to mathematicians and philosophers of logic, mathematics, and science.
An influential position in the philosophy of biology claims that there are no biological laws, since any apparently biological generalization is either too accidental, fact-like or contingent to be named a law, or is simply reducible to physical laws that regulate electrical and chemical interactions taking place between merely physical systems. In the following I will stress a neglected aspect of the debate that emerges directly from the growing importance of mathematical models of biological phenomena. My main aim is (...) to defend, as well as reinforce, the view that there are indeed laws also in biology, and that their difference in stability, contingency or resilience with respect to physical laws is one of degrees, and not of kind. In order to reach this goal, in the next sections I will advance the following two arguments in favor of the existence of biological laws, both of which are meant to stress the similarity between physical and biological laws. (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)
This article suggests that scientific philosophy, especially mathematical philosophy, might be one important way of doing philosophy in the future. Along the way, the article distinguishes between different types of scientific philosophy; it mentions some of the scientific methods that can serve philosophers; it aims to undermine some worries about mathematical philosophy; and it tries to make clear why in certain cases the application of mathematical methods is necessary for philosophical progress.
Traditional logic as a part of philosophy is one of the oldest scientific disciplines. Mathematical logic, however, is a relatively young discipline and arose from the endeavors of Peano, Frege, Russell and others to create a logistic foundation for mathematics. It steadily developed during the 20th century into a broad discipline with several sub-areas and numerous applications in mathematics, informatics, linguistics and philosophy. While there are already several well-known textbooks on mathematical logic, this book is unique in that (...) it is much more concise than most others, and the material is treated in a streamlined fashion which allows the professor to cover many important topics in a one semester course. Although the book is intended for use as a graduate text, the first three chapters could be understood by undergraduates interested in mathematical logic. These initial chapters cover just the material for an introductory course on mathematical logic combined with the necessary material from set theory. This material is of a descriptive nature, providing a view towards decision problems, automated theorem proving, non-standard models and other subjects. The remaining chapters contain material on logic programming for computer scientists, model theory, recursion theory, Godel’s Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed throughout the text. The author has provided exercises for each chapter, as well as hints to selected exercises. About the German edition: …The book can be useful to the student and lecturer who prepares a mathematical logic course at the university. What a pity that the book is not written in a universal scientific language which mankind has not yet created. - A.Nabebin, Zentralblatt. (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)
Figures of Thought looks at how mathematical works can be read as texts and examines their textual strategies. David Reed offers the first sustained and critical attempt to find a consistent argument or narrative thread in mathematical texts. Reed selects mathematicians from a range of historical periods and compares their approaches to organizing and arguing texts, using an extended commentary on Euclid's Elements as a central structuring framework. He develops fascinating interpretations of mathematicians' work throughout history, from Descartes (...) to Hilbert, Kronecker, Dedekind, Weil and Grothendieck. Reed traces the implications of this approach to the understanding of the history and development of mathematics. (shrink)
Buzaglo (as well as Manders (J Philos LXXXVI(10):553–562, 1989)) shows the way in which it is rational even for a realist to consider ‘development of concepts’, and documents the theory by numerous examples from the area of mathematics. A natural question arises: in which way can the phenomenon of expanding mathematical concepts influence empirical concepts? But at the same time a more general question can be formulated: in which way do the mathematical concepts influence empirical concepts? What I (...) want to show in the present paper can be described as follows. The problem articulated by Buzaglo deserves some semantic refinements. Following explications are needed: What is meaning? (In particular: What are concepts?) What are questions? (Or, equivalently: Semantics of interrogative sentences.) -/- Further, a useful notion will be the notion of problem. Taking over the notion of conceptual system from Materna (Conceptual Systems. Logos, Berlin, 2004) and using Tichý’s Transparent intensional logic (TIL) I can try to solve the problem of the relation between mathematical and empirical concepts (not only for the case of expanding some mathematical concepts). (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)
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems.The logical systems presented are:- Propositional calculus (including binary decision diagrams);- Predicate calculus;- Resolution;- Hoare logic;- (...) Z;- Temporal logic.Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5 Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency, programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education. (shrink)
Proceedings of the Tenth Brazilian Conference on Mathematical Logic. Coleção CLE, volume 14, 1995. Centro De Lógica, Epistemologia e História da Ciência, Unicamp, Campinas, SP, Brazil.
Reasoning under uncertainty, that is, making judgements with only partial knowledge, is a major theme in artificial intelligence. Professor Paris provides here an introduction to the mathematical foundations of the subject. It is suited for readers with some knowledge of undergraduate mathematics but is otherwise self-contained, collecting together the key results on the subject, and formalising within a unified framework the main contemporary approaches and assumptions. The author has concentrated on giving clear mathematical formulations, analyses, justifications and consequences (...) of the main theories about uncertain reasoning, so the book can serve as a textbook for beginners or as a starting point for further basic research into the subject. It will be welcomed by graduate students and research workers in logic, philosophy, and computer science as a textbook for beginners, a starting point for further basic research into the subject, and not least, an account of how mathematics and artificial intelligence can complement and enrich each other. (shrink)
The article deals with historical dynamics of implicit and intuitive elements of mathematical knowledge. The author describes historical dynamics of implicit and intuitive elements and discloses a historical and evolutionary mechanism of building up mathematical knowledge. Each requirement to increase the level of theoretical rigor in mathematics is historically realized as a three-stage process. The first stage considers some general conditions of valid mathematical knowledge recognized by the mathematical community. The second one reveals the level of (...) theoretical rigor increasing, while the third one is characterized by explication of the hidden lemmas. A detailed discussion of historical substantiation of the basic algebra theorem is conducted according to the proposed technique. (shrink)
Lately, philosophers of mathematics have been exploring the notion of mathematical explanation within mathematics. This project is supposed to be analogous to the search for the correct analysis of scientific explanation. I argue here that given the way philosophers have been using “explanation,” the term is not applicable to mathematics as it is in science.
The published works of scientists often conceal the cognitive processes that led to their results. Scholars of mathematical practice must therefore seek out less obvious sources. This article analyzes a widely circulated mathematical joke, comprising a list of spurious proof types. An account is proposed in terms of argumentation schemes: stereotypical patterns of reasoning, which may be accompanied by critical questions itemizing possible lines of defeat. It is argued that humor is associated with risky forms of inference, which (...) are essential to creative mathematics. The components of the joke are explicated by argumentation schemes devised for application to topic-neutral reasoning. These in turn are classified under seven headings: retroduction, citation, intuition, meta-argument, closure, generalization, and definition. Finally, the wider significance of this account for the cognitive science of mathematics is discussed. (shrink)
We describe recent developments in research on mathematical practice and cognition and outline the nine contributions in this special issue of topiCS. We divide these contributions into those that address (a) mathematical reasoning: patterns, levels, and evaluation; (b) mathematical concepts: evolution and meaning; and (c) the number concept: representation and processing.
This article looks at recent work in cognitive science on mathematical cognition from the perspective of history and philosophy of mathematical practice. The discussion is focused on the work of Lakoff and Núñez, because this is the first comprehensive account of mathematical cognition that also addresses advanced mathematics and its history. Building on a distinction between mathematics as it is presented in textbooks and as it presents itself to the researcher, it is argued that the focus of (...) cognitive analyses of historical developments of mathematics has been primarily on the former, even if they claim to be about the latter. (shrink)
A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included.
Presents the latest research on how reasoning with analogies, metaphors, metonymies, and images can facilitate mathematical understanding. For math education, educational psychology, and cognitive science scholars.
In this paper, I discuss the social philosopher Pierre Bourdieu’s concept of habitus, and use it to locate and examine dispositions in a larger constellation of related concepts, exploring their dynamic relationship within the social context, and their construction, manifestation, and function in relation to classroom mathematics practices. I describe the main characteristics of habitus that account for its invisible effects: its embodiment, its deep and pre-reflective internalization as schemata, orientation, and taste that are learned and yet unthought, and are (...) subsumed by our practices, which we understand as something that “goes without saying.” I also propose that, similarly to Bourdieu’s concept of linguistic habitus, a math habitus is made up of a complex intertwining of collective and individual histories that turn into “nature,” which structure all individual and collective action and inform mathematical classroom practice. I suggest that individual math dispositions may be liable to reconstruction through the reconstruction of the collective math habitus, which follows from opening spaces for dialogue, problematization and reconstruction of the unthought categories of the doxa. This requires that students acquire new concrete and symbolic means with which to challenge their current sense of mathematics as a discipline, and mathematical practice tout court. Finally, I argue that community of inquiry, employed as a pedagogical model, provides an avenue for both: for opening those spaces for reflective dialogical inquiry into concepts and questions whose meanings and references have so far been taken for granted, and for acquiring critical thinking and dialogical skills and dispositions that are a necessary means for participating in such reflective inquiry that offers significant promise for reconstructing individual and collective habitus in school settings. (shrink)
Q.E.D. presents some of the most famous mathematical proofs in a charming book that will appeal to nonmathematicians and math experts alike. Grasp in an instant why Pythagoras’s theorem must be correct. Follow the ancient Chinese proof of the volume formula for the frustrating frustum, and Archimedes’ method for finding the volume of a sphere. Discover the secrets of pi and why, contrary to popular belief, squaring the circle really is possible. Study the subtle art of mathematical domino (...) tumbling, and find out how slicing cones helped save a city and put a man on the moon. (shrink)
Suitable for advanced undergraduates and graduate students from diverse fields and varying backgrounds, this self-contained course in mathematical logic features numerous exercises that vary in difficulty. The author is a Professor of Mathematics at the University of Wisconsin.
An excellent introduction to mathematical logic, this book provides readers with a sound knowledge of the most important approaches to the subject, stressing the use of logical methods in attacking nontrivial problems. It covers the logic of classes, of propositions, of propositional functions, and the general syntax of language, with a brief introduction that also illustrates applications to so-called undecidability and incompleteness theorems. Other topics include the simple proof of the completeness of the theory of combinations, Church's theorem on (...) the recursive unsolvability of the decision problem for the restricted function calculus, and the demonstrable properties of a formal system as a criterion for its acceptability. 1950 ed. (shrink)
This book presents a comprehensive treatment of basic mathematical logic. The author's aim is to make exact the vague, intuitive notions of natural number, preciseness, and correctness, and to invent a method whereby these notions can be communicated to others and stored in the memory. He adopts a symbolic language in which ideas about natural numbers can be stated precisely and meaningfully, and then investigates the properties and limitations of this language. The treatment of mathematical concepts in the (...) main body of the text is rigorous, but, a section of 'historical remarks' traces the evolution of the ideas presented in each chapter. Sources of the original accounts of these developments are listed in the bibliography. (shrink)
This fundamental and straightforward text addresses a weakness observed among present-day students, namely a lack of familiarity with formal proof. Beginning with the idea of mathematical proof and the need for it, associated technical and logical skills are developed with care and then brought to bear on the core material of analysis in such a lucid presentation that the development reads naturally and in a straightforward progression. Retaining the core text, the second edition has additional worked examples which users (...) have indicated a need for, in addition to more emphasis on how analysis can be used to tell the accuracy of the approximations to the quantities of interest which arise in analytical limits. (shrink)
Philosophy of Mathematics is clear and engaging, and student friendly The book discusses the great philosophers and the importance of mathematics to their thought. Among topics discussed in the book are the mathematical image, platonism, picture-proofs, applied mathematics, Hilbert and Godel, knots and notation definitions, picture-proofs and Wittgenstein, computation, proof and conjecture.
1. Introduction : the mathematical image -- 2. Platonism -- 3. Picture-proofs and Platonism -- 4. What is applied mathematics? -- 5. Hilbert and Gödel -- 6. Knots and notation -- 7. What is a definition? -- 8. Constructive approaches -- 9. Proofs, pictures and procedures in Wittgenstein -- 10. Computation, proof and conjecture -- 11. How to refute the continuum hypothesis -- 12. Calling the bluff.
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.
Stimulating, thought-provoking analysis of a number of the most interesting intellectual inconsistencies in mathematics, physics and language. Delightful elucidations of methods for misunderstanding the real world of experiment (Aristotle’s Circle paradox), being led astray by algebra (De Morgan’s paradox) and other mind-benders. Some high school algebra and geometry is assumed; any other math needed is developed in text. Reprint of 1982 ed.
This text is an ideal introduction for students to the basic mathematics of operations research as well as a valuable source of references to early literature ...
Logic forms the basis of mathematics and is a fundamental part of any mathematics course. This book provides students with a clear and accessible introduction to this important subject, using the concept of model as the main focus and covering a wide area of logic. The chapters of the book cover propositional calculus, boolean algebras, predicate calculus and completelness theorems with answeres to all of the excercises and the end of the volume. This is an ideal introduction to mathematics and (...) logic for the advanced undergraduate student. (shrink)
In his book The Value of Science Poincaré criticizes a certain view on the growth of mathematical knowledge: “The advance of science is not comparable to the changes of a city, where old edifices are pitilessly torn down to give place to new ones, but to the continuous evolution of zoological types which develop ceaselessly and end by becoming unrecognizable to the common sight, but where an expert eye finds always traces of the prior work of the centuries past” (...) (Poincaré 1958, p. 14). The view criticized by Poincaré corresponds to Frege’s idea that the development of mathematics can be described as an activity of system building, where each system is supposed to provide a complete representation for a certain mathematical field and must be pitilessly torn down whenever it fails to achieve such an aim. All facts concerning any mathematical field must be fully organized in a given system because “in mathematics we must always strive after a system that is complete in itself” (Frege 1979, p. 279). Frege is aware that systems introduce rigidity and are in conflict with the actual development of mathematics because “in history we have development; a system is static”, but he sticks to the view that “science only comes to fruition in a system” because “only through a system can we achieve complete clarity and order” (Frege 1979, p. 242). He even goes so far as saying that “no science can be so enveloped in obscurity as mathematics, if it fails to construct a system” (Frege 1979, p. 242). By ‘system’ Frege means ‘axiomatic system’. In his view, in mathematics we cannot rest content with the fact that “we are convinced of something, but we must strive to obtain a clear insight into the network of inferences that support our conviction”, that is, to find “what the primitive truths are”, because “only in this way can a system be constructed” (Frege 1979, p. 205). The primitive truths are the principles of the axiomatic system. Frege’s stress on the role of systems also determines his views on the growth of mathematical knowledge.. (shrink)
The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...
Summarizing a surrounding 200 pages, pages 179 to 190 of Shadows of the Mind contain a future dialog between a human identified as "Albert Imperator" and an advanced robot, the "Mathematically Justified Cybersystem", allegedly Albert's creation. The two have been discussing a Gödel sentence for an algorithm by which a robot society named SMIRC certifies mathematical proofs. The sentence, referred to in mathematicalnotation as Omega(Q*), is to be precisely constructed from on a definition of SMIRC's algorithm. (...) It can be interpreted as stating "SMIRC's algorithm cannot certify this statement." The robot has asserted that SMIRC never makes mistakes. If so, SMIRC's algorithm cannot certify the Goedel sentence, for that would make the statement false. But, if they can't certify it, what is says is true! Humans can understand it is true, but mighty SMIRC cannot certify it. The dialog ends melodramatically as the robot, apparently unhinged by this revelation, claims to be a messenger of god, and the human shuts it down with a secret control. (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 mathematicalnotation 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)
Clear definitions of alienation and solidarity are needed as a step toward an explicit theory of social integration. The idea of alienation has played a key role in the development of sociology, but it's meaning has never been clear. Both theories and empirical studies confound relational-dispositional, cognitive-emotional and/or interpersonal-societal components. This essay proposes definitions that follow from the work of Erving Goffman and others. Goffman's idea of "co-presence" implies a model of solidarity as mutual awareness to the point of merging (...) consciousness. It appears that this concept of solidarity could be the main component of shared context, consensus, genuine love and social facts. Two empirical approaches are described, one with moment by moment analysis of dialogue, the other using sample surveys. With the use of mathematicalnotation, the survey method might be used to analyze social facts. The model could also form the basis for an explicit and testable theory of social integration. (shrink)
This article proposes that Goffman's "Frame Analysis" can be interpreted as a step toward unpacking the idea of context. His analysis implies a recursive model involving frames within frames. The key problem is that neither Goffman nor anyone else has clearly defined what is meant by a frame. I propose that it can be represented by a word, phrase, or proposition. A subjective context can be represented as an assembly of these items, joined together by operators such as and, since, (...) if, not, and then. Furthermore, this model can be combined with the recursive levels of mutual awareness in earlier approaches to consensus. The combination would represent the inter subjective context: it can be used to find the minimum amount of background that would allow consensual interpretations of discourse. It could also construct a chain that links discourse to the institutional level, the micro-macro pathway from word and gesture to social structure. Goffman hinted that mathematicalnotation might be used to represent a frame assembly. By adding levels of awareness to such notation, it could represent social facts. Because the use of vernacular words rather than concepts is a problem in social science, Goffman's approach has a general as well as a particular significance. (shrink)
LN , so f lies in the elementary submodel M'. Clearly co 9 M' . It follows that 6 = {f(n): n em} is included in M'. Hence the ordinals of M' form an initial ...
" There are 31 chapters in 5 parts and approximately 320 exercises marked by difficulty and whether or not they are necessary for further work in the book.
The paper deals with the semantics of mathematicalnotation. In arithmetic, for example, the syntactic shape of a formula represents a particular way of specifying, arriving at, or constructing an arithmetical object (that is, a number, a function, or a truth value). A general definition of this sense of "construction" is proposed and compared with related notions, in particular with Frege's concept of "function" and Carnap's concept of "intensional isomorphism." It is argued that constructions constitute the proper subject (...) matter of both logic and mathematics, and that a coherent semantic account of mathematical formulas cannot be given without assuming that they serve as names of constructions. (shrink)
CONTINUOUS MODEL THEORY CHAPTER I TOPOLOGICAL PRELIMINARIES. Notation Throughout the monograph our mathematicalnotation does not differ drastically from ...
A widely circulated list of spurious proof types may help to clarify our understanding of informal mathematical reasoning. An account in terms of argumentation schemes is proposed.
Chapter Some topics in semantics Aims of this study The central preoccupation of this study is semantic. It is intended as a modest contribution to the ...
(or not oveA-complete.) . Let * be a unary operator defined on the set F of formulas of the language £ (ie, if A is a formula of £, then *A is also a ...
This volume is about searching for fundamental theory in physics which has become somewhat elusive in recent decades. Like a group of blind men investigating an elephant, one physicist postulates the trunk as a hose, another a leg as a tree, the body a wall or barrier, the tail a rope and the ears as a fan. The organizers of the Vigier series symposia strongly believe cross polination by exploring many avenues of seemingly disparate research is key to breakthrough discovery (...) and solicited papers on all areas of physics deemed pertinent in Astrophysics, Cosmology, nuclear physics, quantum theory, electromagnetism, thermodynamics, vacuum field theory and topology. (shrink)
