This Element lays the foundation, introduces a framework, and sketches the program for a systematic study of mathematical notations. It is written for everyone who is curious about the world of symbols that surrounds us, in particular researchers and students in philosophy, history, cognitive science, and mathematics education. The main characteristics of mathematical notations are introduced and discussed in relation to the intended subject matter, the language in which the notations are verbalized, the cognitive resources needed for learning (...) and understanding them, the tasks that they are used for, their material basis, and the historical context in which they are situated. Specific criteria for the design and assessment of notations are discussed, as well as ontological, epistemological, and methodological questions that arise from the study of mathematical notations and of their use in mathematical practice. (shrink)

Mathematical notation includes a vast array of signs. Most mathematical signs appear to be symbolic, in the sense that their meaning is arbitrarily related to their visual appearance. We explored the hypothesis that mathematical signs with iconic aspects—those which visually resemble in some way the concepts they represent—offer a cognitive advantage over those which are purely symbolic. An early formulation of this hypothesis was made by Christine Ladd in 1883 who suggested that symmetrical signs should be (...) used to convey commutative relations, because they visually resemble the mathematical concept they represent. Two controlled experiments provide the first empirical test of, and evidence for, Ladd's hypothesis. In Experiment 1 we find that participants are more likely to attribute commutativity to operations denoted by symmetric signs. In Experiment 2 we further show that using symmetric signs as notation for commutative operations can increase mathematical performance. (shrink)

The design of good notation is a cause that was dear to Charles Babbage's heart throughout his career. He was convinced of the "immense power of signs" (1864, 364), both to rigorously express complex ideas and to facilitate the discovery of new ones. As a young man, he promoted the Leibnizian notation for the calculus in England, and later he developed a Mechanical Notation for designing his computational engines. In addition, he reflected on the principles that underlie (...) the design of good mathematical notations. In this paper, we discuss these reflections, which can be found somewhat scattered in Babbage's writings, for the first time in a systematic way. Babbage's desiderata for mathematical notations are presented as ten guidelines pertinent to notational design and its application to both individual symbols and complex expressions. To illustrate the applicability of these guidelines in non-mathematical domains, some aspects of his Mechanical Notation are also discussed. (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)

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 terms of a mathematical problem become precise and concise if they are expressed in an appropriate notation, therefore notations are useful to mathematics. But are notations only useful, or also essential? According to prevailing view, they are not essential. Contrary to this view, this paper argues that notations are essential to mathematics, because they may play a crucial role in mathematical discovery. Specifically, since notations may consist of symbolic notations, diagrammatic notations, or a mix of symbolic (...) and diagrammatic notations, notations may play a crucial role in mathematical discovery in different ways. Some examples are given to illustrate these ways. (shrink)

Gregory Landini offers a detailed historical account of Frege's notations and the philosophical views that led Frege from Begriffssscrhrift to his mature work Grundgesetze, addressing controversial issues that surround the notations.

Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions. Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs. In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show (...) that diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability. I then consider whether diagrams can be essential to the proofs in which they appear. (shrink)

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore the relationship (...) between the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

This chapter contains sections titled: Introduction A Methodology for Ontology The Need for a Criterion of Ontological Commitment The Role of a Canonical Notation The Ontology of Mathematics The Notion of Existence The Ontology of Natural Sciences Do Intensions Belong to the Furniture of the World? How to Treat Intensional Contexts without Positing Intensions Fiction, Intentional Objects and Existence Lesniewski's Ontology Acknowledgments.

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)

This introduction to the philosophy of mathematics focuses on contemporary debates in an important and central area of philosophy. The reader is taken on a fascinating and entertaining journey through some intriguing mathematical and philosophical territory, including such topics as the realism/anti-realism debate in mathematics, mathematical explanation, the limits of mathematics, the significance of mathematical notation, inconsistent mathematics and the applications of mathematics. Each chapter has a number of discussion questions and recommended further reading from both (...) the contemporary literature and older sources. Very little mathematical background is assumed and all of the mathematics encountered is clearly introduced and explained using a wide variety of examples. The book is suitable for an undergraduate course in philosophy of mathematics and, more widely, for anyone interested in philosophy and mathematics. (shrink)

G. Jäger gave in Arch. Math. Logik Grundlagenforsch. 24 , 49-62, a recursive notation system on a basis of a hierarchy Iαß of α-inaccessible regular ordinals using collapsing functions following W. Buchholz in Ann. Pure Appl. Logic 32 , 195-207. Jäger's system stops, when ordinals α with Iα0 = α enter. This border is now overcome by introducing additional a hierarchy Jαß of weakly inaccessible Mahlo numbers, which is defined similarly to the Jäger hierarchy. An ordinal μ is called (...) Mahlo, if every normal-function f : μ → μ has regular fixpoints. Collapsing is defined for both Mahlo and simply regular ordinals such that for every Mahlo ordinal μ out of the J-hierarchy Ψμα is a regular σ such that Iσ0 = σ. For these regular σ again collapsing functions Ψσ are defined. To get a proper systematical order into the collapsing procedure, a pair of ordinals is associated to σ and α, and the definition of Ψσα is given by recursion on a suitable well-ordering of these pairs. Thus a fairly large system of ordinal notations can be established. It seems rather straightforward, how to extend this setting further. (shrink)

Although traditionally neglected, mathematical diagrams have recently begun to attract attention from philosophers of mathematics. By now, the literature includes several case studies investigating the role of diagrams both in discovery and justification. Certain preliminary questions have, however, been mostly bypassed. What are diagrams exactly? Are there different types of diagrams? In the scholarly literature, the term “mathematical diagram” is used in diverse ways. I propose a working definition that carves out the phenomena that are of most importance (...) for a taxonomy of diagrams in the context of a practice-based philosophy of mathematics, privileging examples from contemporary mathematics. In doing so, I move away from vague, ordinary notions. I define mathematical diagrams as forming notational systems and as being geometric/topological representations or two-dimensional representations. I also examine the relationship between mathematical diagrams and spatiotemporal intuition. By proposing an explication of diagrams, I explain certain controversies in the existing literature. Moreover, I shed light on why mathematical diagrams are so effective in certain instances, and, at other times, dangerously misleading. (shrink)

Mathematical Logic: An Introduction is a textbook that uses mathematical tools to investigate mathematics itself. In particular, the concepts of proof and truth are examined. The book presents the fundamental topics in mathematical logic and presents clear and complete proofs throughout the text. Such proofs are used to develop the language of propositional logic and the language of first-order logic, including the notion of a formal deduction. The text also covers Tarski’s definition of truth and the computability (...) concept. It also provides coherent proofs of Godel’s completeness and incompleteness theorems. Moreover, the text was written with the student in mind and thus, it provides an accessible introduction to mathematical logic. In particular, the text explicitly shows the reader how to prove the basic theorems and presents detailed proofs throughout the book. Most undergraduate books on mathematical logic are written for a reader who is well-versed in logical notation and mathematical proof. This textbook is written to attract a wider audience, including students who are not yet experts in the art of mathematical proof. (shrink)

The aim of the present thesis is twofold. First we propose a constructive solution to Frege's puzzle using an approach based on homotopy type theory, a newly proposed foundation of mathematics that possesses a higher-dimensional treatment of equality. We claim that, from the viewpoint of constructivism, Frege's solution is unable to explain the so-called ‘cognitive significance' of equality statements, since, as we shall argue, not only statements of the form 'a = b', but also 'a = a' may contribute to (...) an extension of knowledge. Second, we study this higher-dimensional account of equality from a constructive (computational) standpoint and, based on these considerations, we offer a new perspective to the project proposed by Peter Aczel of developing conventions and notations for an informal style of doing mathematics in type theory. To that end, we adopt the cubical type theory of Angiuli, Favonia and Harper, a framework that can be seen as constructive refinement of the ideas of homotopy type theory. (shrink)

Mathematics is a highly specialised arena of human endeavour, one in which complex notations are invented and are subjected to complex and involved manipulations in the course of everyday work. What part do these writing practices play in mathematical communication, and how can we understand their use in the mathematical world in relation to theories of communication and cognition? To answer this, I examine in detail an excerpt from a research meeting in which communicative board-writing practices can be (...) observed, and attempt to explain the observed exchanges with reference to relevance theory (a cognitivist theory of pragmatics), in combination with the situated cognition paradigm. Successful communication in the excerpt appears well described by the notion of metacognitive acquaintance, as described inSperber & Wilson (2015), especially when a situated view of cognition is adopted. Though this example is taken from a relatively informal face-to-face communicative situation, characteristics of such situations extend even into formal written mathematics, since even the technical terminology developed in the course of the meeting includes details that may provide readers with a kind of access to the mathematicians’ cognitive processes. (shrink)

In what way does a mathematical proof depend on the notation used in its presentation? This paper examines this question by analysing the computational differences, in the sense of Larkin and Simon's ‘Why a diagram is (sometimes) worth 10,000 words’, between diagrammatic and sentential notations as a means for presenting geometric proofs. Wittgenstein takes up the question of mathematical notation and proof in Section III of Remarks on the Foundations of Mathematics. After discussing his observations on (...) a proof's ‘characteristic visual shape’ in Section III with respect to arithmetical proofs, the paper shows how the notion of a characteristic visual shape illuminates the special effectiveness of diagrammatic notation in geometry. (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)

In this article we investigate whether the following conjecture is true or not: does the addition-free theta functions form a canonical notation system for the linear versions of Friedman’s well-partial-orders with the so-called gap-condition over a finite set of n labels. Rather surprisingly, we can show this is the case for two labels, but not for more than two labels. To this end, we determine the order type of the notation systems for addition-free theta functions in terms of (...) ordinals less than ε0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon _0$$\end{document}. We further show that the maximal order type of the Friedman ordering can be obtained by a certain ordinal notation system which is based on specific binary theta functions. (shrink)

Peano was one of the driving forces behind the development of the current mathematical formalism. In this paper, we study his particular approach to notational design and present some original features of his notations. To explain the motivations underlying Peano's approach, we first present his view of logic as a method of analysis and his desire for a rigorous and concise symbolism to represent mathematical ideas. On the basis of both his practice and his explicit reflections on notations, (...) we discuss the principles that guided Peano's introduction of new symbols, the choice of characters, and the layout of formulas. Finally, we take a closer look, from a systematic and historical perspective, at one of Peano's most striking innovations, his use of dots for the grouping of subformulas. (shrink)

The Turing degrees of infinite levels of the Ershov hierarchy were studied by Liu and Peng [8]. In this paper, we continue the study of Turing degrees of infinite levels and lift the study of density property to the levels beyond ω2. In doing so, we rely on notations with some nice properties. We introduce the concept of normalizing notations and generate normalizing notations for higher levels. The generalizations of the weak density theorem and the nondensity theorem are proved for (...) higher levels in the Ershov hierarchy. Furthermore, we also investigate the minimal degrees in the infinite levels of the Ershov hierarchy. (shrink)

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain (...) in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

View more Abstract If logical truth is necessitated by sheer syntax, mathematics is categorially unlike logic even if all mathematics derives from definitions and logical principles. This contrast gets obscured by the plausibility of the Synonym Substitution Principle implicit in conceptions of analyticity: synonym substitution cannot alter sentence sense. The Principle obviously fails with intercepting: nonuniform term substitution in logical sentences. ‘Televisions are televisions’ and ‘TVs are televisions’ neither sound alike nor are used interchangeably. Interception synonymy gets assumed because logical (...) sentences and their synomic interceptions have identical factual content, which seems to exhaust semantic content. However, intercepting alters syntax by eliminating term recurrence, the sole strictly syntactic means of ensuring necessary term coextension, and thereby syntactically securing necessary truth. Interceptional necessity is lexical, a notational artifact. The denial of interception nonsynonymy and the disregard of term recurrence in logic link with many misconceptions about propositions, logical form, conventions, and metalanguages. Mathematics is distinct from logic: its truth is not syntactic; it is transmitted by synonym substitution; term recurrence has no essential role. The ‘=’ of mathematics is an objectual relation between numbers; the ‘=’ of logic marks a syntactic relation of coreferring terms. -/- . (shrink)

As is well known, it was only in 1926 that a comprehensive mathematical theory of braids was published—that of Emil Artin. That said, braids had been researched mathematically before Artin’s treatment: Alexandre Theophile Vandermonde, Carl Friedrich Gauß and Peter Guthrie Tait had all attempted to introduce notations for braids. Nevertheless, it was only Artin’s approach that proved to be successful. Though the historical reasons for the success of Artin’s approach are known, a question arises as to whether other approaches (...) to deal with braids existed, approaches that were developed after Artin’s article and were essentially different from his approach. The answer, as will be shown, is positive: Modesto Dedò developed in 1950 another notation for braids, though one, which was afterward forgotten or ignored. This raises a more general question: what was the role of Artin’s notation, or, respectively, Dedò’s, that enabled either the acceptance or the neglect of their theories? More philosophically, can notation be an epistemic technique, prompting new discoveries, or rather, can it also operate an as obstacle? The paper will analyze the method introduced by Dedò to notate braids, and also its history and implications. It aims to show that Dedò, in contrast to Artin, focused on factorizations of braids and the algebraic relations between the operations done on these factorizations. Dedò’s research was done against the background of Oscar Chisini’s research of algebraic curves on the one hand and of Artin’s successful notation of braids on the other hand. Taking this into account, the paper will in addition look into the epistemic role of notation, comparing Dedò’s work with Artin’s, as both presented different notations of braids and their deformations. (shrink)

Colonius suggests that, in using standard set theory as the language in which to express our computational-level theory of human memory, we would need to violate the axiom of foundation in order to express meaningful memory bindings in which a context is identical to an item in the list. We circumvent Colonius's objection by allowing that a list item may serve as a label for a context without being identical to that context. This debate serves to highlight the value of (...) specifying memory operations in set theoretic notation, as it would have been difficult if not impossible to formulate such an objection at the algorithmic level. (shrink)

There is a sense in which the symbols used in mathematical expressions and formulas are arbitrary. After all, arithmetic would be no different if we would replace the symbols '+' or '8' by different symbols. Nevertheless, the shape of many mathematical symbols is in fact well motivated in practice. In the case of symbols that were introduced a long time ago, the original motivations remain mostly inaccessible to us. Accordingly, motivations that are discussed in the literature are only (...) ascribed retrospectively and should be considered as post-hoc rationalizations. For more recent introductions of new symbols (e.g., in symbolic logic), however, we sometimes do have first-hand accounts by the authors that inform us of the reasons behind their notational choices. In this paper, I present a systematic overview of possible motivations for the design of mathematical symbols, which include practical (such as ease of writing and reuse of previously used symbols) as well as cognitive aspects (such as indicating relations to other symbols or to their intended meanings). (shrink)

In his long-awaited new edition of Philosophy of Mathematics, James Robert Brown tackles important new as well as enduring questions in the mathematical sciences. Can pictures go beyond being merely suggestive and actually prove anything? Are mathematical results certain? Are experiments of any real value?" "This clear and engaging book takes a unique approach, encompassing nonstandard topics such as the role of visual reasoning, the importance of notation, and the place of computers in mathematics, as well as (...) traditional topics such as formalism, Platonism, and constructivism. The combination of topics and clarity of presentation make it suitable for beginners and experts alike. The revised and updated second edition of Philosophy of Mathematics contains more examples, suggestions for further reading, and expanded material on several topics including a novel approach to the continuum hypothesis."--BOOK JACKET. (shrink)

Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and (...) cardinals, transfinite induction, the axiom of choice, Zorn’s lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process. (shrink)

The nature of time is perceived by intellectuals variedly. An attempt is made in this paper to reconcile such varied views in the light of the Upanishads and related Indian spiritual and philosophical texts. The complex analysis of modern mathematics is used to represent the nature and presentation physical and psychological times so differentiated. Also the relation between time and energy is probed using uncertainty relations, forms of energy and phases of matter.

Which function is computed by a Turing machine will depend on how the symbols it manipulates are interpreted. Further, by invoking bizarre systems of notation it is easy to define Turing machines that compute textbook examples of uncomputable functions, such as the solution to the decision problem for first-order logic. Thus, the distinction between computable and uncomputable functions depends on the system of notation used. This raises the question: which systems of notation are the relevant ones for (...) determining whether a function is computable? These are the acceptable notations. I argue for a use criterion of acceptability: the acceptable notations for a domain of objects D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document} are the notations that we can use for the usual D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document}-activities. Acceptable notations for natural numbers are ones that we can count with. Acceptable notations for logical formulas are the ones that we can use in inference and logical analysis. And so on. This criterion makes computability a relative notion—whether a function is computable depends on which notations are acceptable, which is relative to our interests and abilities. I argue that this is not a problem, however, since there is independent reason for taking the extension of computable function to be relative to contingent facts. Similarly, the fact that the use criterion makes a mathematical distinction depend on practical concerns is also not a problem because it dovetails with similar phenomena in other areas of computability theory, namely the roles of notation in computation over real numbers and of Extended Church’s Thesis in complexity theory. (shrink)