For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existence theorem for minimal degrees.

Mathematical explanations are poorly understood. Although mathematicians seem to regularly suggest that some proofs are explanatory whereas others are not, none of the philosophical accounts of what such claims mean has become widely accepted. In this paper we explore Wilkenfeld’s suggestion that explanations are those sorts of things that generate understanding. By considering a basic model of human cognitive architecture, we suggest that existing accounts of mathematical explanation are all derivable consequences of Wilkenfeld’s ‘functional explanation’ proposal. We therefore (...) argue that the explanatory criteria offered by earlier accounts can all be thought of as features that make it more likely that a mathematical proof will generate understanding. On the functional account, features such as characterising properties, unification, and salience correlate with explanatoriness, but they do not define explanatoriness. (shrink)

Name der Zeitschrift: Semiotica Jahrgang: 2018 Heft: 225 Seiten: 457-487.

The Dutch mathematician and philosopher L. E. J. Brouwer (1881-1966) developed a foundation for mathematics called 'intuitionism'. Intuitionism considers mathematics to consist in acts of mental construction based on internal time awareness. According to Brouwer, that awareness provides the fundamental structure to all exact thinking. In this note, it will be shown how this strand of thought leads to an intuitionistic function that is effectively computable yet non-recursive.

This book is dedicated to a classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient (...) formal logic to give a full development of Gödel's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics". (shrink)

A rank function for a directed graph G assigns elements of a well ordering to the vertices of G in a fashion that preserves the order induced by the edges. While topological sortings require a one-to-one matching of vertices and elements of the ordering, rank functions frequently must assign several vertices the same value. Theorems stating basic properties of rank functions vary significantly in logical strength. Using the techniques of reverse mathematics, we present results that require the subsystems ${\ensuremath{\vec{RCA}_0}}$ (...) , ${{\vec{ACA}_0}}$ , ${{\vec{ATR}_0}}$ , and ${{\vec{\Pi^1_1 - CA}_0}}$. (shrink)

The program of Reverse Mathematics (Simpson 2009) has provided us with the insight that most theorems of ordinary mathematics are either equivalent to one of a select few logical principles, or provable in a weak base theory. In this paper, we study the properties of the Dirac delta function (Dirac 1927; Schwartz 1951) in two settings of Reverse Mathematics. In particular, we consider the Dirac Delta Theorem, which formalizes the well-known property \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...) \setlength{\oddsidemargin}{-69pt} \begin{document}$${\int_\mathbb{R}f(x)\delta(x)\,dx=f(0)}$$\end{document} of the Dirac delta function. We show that the Dirac Delta Theorem is equivalent to weak König’s Lemma (see Yu and Simpson in Arch Math Log 30(3):171–180, 1990) in classical Reverse Mathematics. This further validates the status of WWKL0 as one of the ‘Big’ systems of Reverse Mathematics. In the context of ERNA’s Reverse Mathematics (Sanders in J Symb Log 76(2):637–664, 2011), we show that the Dirac Delta Theorem is equivalent to the Universal Transfer Principle. Since the Universal Transfer Principle corresponds to WKL, it seems that, in ERNA’s Reverse Mathematics, the principles corresponding to WKL and WWKL coincide. Hence, ERNA’s Reverse Mathematics is actually coarser than classical Reverse Mathematics, although the base theory has lower first-order strength. (shrink)

Carnegie explains why she's late for school--a tiger jumped in her window.

This essay discusses the instructional value of mathematical proofs using different interpretations of the analysis cum synthesis method in Apollonius’ Conics as a case study. My argument is informed by Descartes’ complaint about ancient geometers and William Thurston’s discussion on how mathematical understanding is communicated. Three historical frameworks of the analysis/synthesis distinction are used to understand the instructive function of the analysis cum synthesis method: the directional interpretation, the structuralist interpretation, and the phenomenological interpretation. I apply these (...) interpretations to the analysis cum synthesis method in order reveal how the same underlying mathematical activity occurs at different levels of scale: at the level of an individual proof, at the level of a collection of proofs, and at the level of a single line within a proof. On the basis of this investigation, I argue that the instructive value of mathematical proof lies in engendering in the reader the same mathematical activity experienced by the author themselves. (shrink)

We give an overview of the role of equicontinuity of sequences of real-valued functions on [0,1] and related notions in classical mathematics, intuitionistic mathematics, Bishop’s constructive mathematics, and Russian recursive mathematics. We then study the logical strength of theorems concerning these notions within the programme of Constructive Reverse Mathematics. It appears that many of these theorems, like a version of Ascoli’s Lemma, are equivalent to fan-theoretic principles.

The accurate annotation of an unknown protein sequence depends on extant data of template sequences. This could be empirical or sets of reference sequences, and provides an exhaustive pool of probable functions. Individual methods of predicting dominant function possess shortcomings such as varying degrees of inter-sequence redundancy, arbitrary domain inclusion thresholds, heterogeneous parameterization protocols, and ill-conditioned input channels. Here, I present a rigorous theoretical derivation of various steps of a generic algorithm that integrates and utilizes several statistical methods to (...) predict the dominant function in unknown protein sequences. The accompanying mathematical proofs, interval definitions, analysis, and numerical computations presented are meant to offer insights not only into the specificity and accuracy of predictions, but also provide details of the operatic mechanisms involved in the integration and its ensuing rigor. The algorithm uses numerically modified raw hidden markov model scores of well defined sets of training sequences and clusters them on the basis of known function. The results are then fed into an artificial neural network, the predictions of which can be refined using the available data. This pipeline is trained recursively and can be used to discern the dominant principal function, and thereby, annotate an unknown protein sequence. Whilst, the approach is complex, the specificity of the final predictions can benefit laboratory workers design their experiments with greater confidence. -/- . (shrink)

The purpose of this book is to introduce the basic ideas of mathematical proof to students embarking on university mathematics. The emphasis is on helping the reader in understanding and constructing proofs and writing clear mathematics. This is achieved by exploring set theory, combinatorics and number theory, topics which include many fundamental ideas which are part of the tool kit of any mathematician. This material illustrates how familiar ideas can be formulated rigorously, provides examples demonstrating a wide range of (...) basic methods of proof, and includes some of the classic proofs. The book presents mathematics as a continually developing subject. Material meeting the needs of readers from a wide range of backgrounds is included. Over 250 problems include questions to interest and challenge the most able student as well as plenty of routine exercises to help familiarize the reader with the basic ideas. (shrink)

Several philosophers have suggested that some scientific explanations work not by virtue of describing aspects of the world’s causal history and relations, but rather by citing mathematical facts. This paper investigates what mathematical facts could be in order for them to figure in such “distinctively mathematical” scientific explanations. For “distinctively mathematical explanations” to be explanations by constraint, mathematical language cannot operate in science as representationalism or platonism describes. It can operate as Aristotelian realism describes. That (...) is because Aristotelian realism enables mathematics to apply to the physical world without a morphism’s mediation. (shrink)

This paper considers the role of mathematics in the process of acquiring new knowledge in physics and astronomy. The defining of the notions of continuum and discreteness in mathematics and the natural sciences is examined. The basic forms of representing the heuristic function of mathematics at theoretical and empirical levels of knowledge are studied: deducing consequences from the axiomatic system of theory, the method of generating mathematical hypotheses, “pure” proofs for the existence of objects and processes, mathematical (...) modelling, the formation of mathematics on the basis of internal mathematical principles and the mathematical theory of experiment. (shrink)

Stereotypes of social construction suggest that the existence of social constructs is accidental and that such constructs have arbitrary and subjective features. In this paper, I explore a conception of social construction according to which it consists in the collective imposition of function onto reality and show that, according to this conception, these stereotypes are incorrect. In particular, I argue that the collective imposition of function onto reality is typically non-accidental and that the products of such imposition frequently (...) have non-arbitrary and objective features. These conclusions are interesting in and of themselves since they debunk important aspects of our socially constructed conception of social construction. Yet, additionally, they have important implications for the viability of mathematical social constructivism since resistance to such constructivism is frequently grounded in the observation that mathematics is non-accidental, non-arbitrary, and objective. As a secondary focus, I explore these implications in this paper. (shrink)

This paper argues that a criticism attributed to Gregory Bateson – that the term ‘function’ is from mathematics and has no place in social science – looks incoherent, when subject to clarification.

Phenomena covered by the term duality occur throughout the history of mathematics in all of its branches, from the duality of polyhedra to Langlands duality. By looking to an “internal epistemology” of duality, we try to understand the gains mathematicians have found in exploiting dual situations. We approach these questions by means of a category theoretic understanding. Following Mac Lane and Lawvere-Rosebrugh, we distinguish between “axiomatic” or “formal” (or Gergonne-type) dualities on the one hand and “functional” or “concrete” (or Poncelet-type) (...) dualities on the other. While the former are often used in the pursuit of a “two theorems by one proof”-strategy, the latter often allow the investigation of “spaces” by studying functions defined on them, which in Grothendieck's terms amounts to the strategy of proving a theorem by working in a dually equivalent framework where the corresponding proof is easier to find. We try to show by some examples that in the first case, dual objects tend to be more ideal (epistemologically more remote) than original ones, while this is not necessarily so in the second case. (shrink)

In this paper, we discuss the history of the concept of function and emphasize in particular how problems in physics have led to essential changes in its definition and application in mathematical practices. Euler defined a function as an analytic expression, whereas Dirichlet defined it as a variable that depends in an arbitrary manner on another variable. The change was required when mathematicians discovered that analytic expressions were not sufficient to represent physical phenomena such as the vibration (...) of a string and heat conduction. The introduction of generalized functions or distributions is shown to stem partly from the development of new theories of physics such as electrical engineering and quantum mechanics that led to the use of improper functions such as the delta function that demanded a proper foundation. We argue that the development of student understanding of mathematics and its nature is enhanced by embedding mathematical concepts and theories, within an explicit–reflective framework, into a rich historical context emphasizing its interaction with other disciplines such as physics. Students recognize and become engaged with meta-discursive rules governing mathematics. Mathematics teachers can thereby teach inquiry in mathematics as it occurs in the sciences, as mathematical practice aimed at obtaining new mathematical knowledge. We illustrate such a historical teaching and learning of mathematics within an explicit and reflective framework by two examples of student-directed, problem-oriented project work following the Roskilde Model, in which the connection to physics is explicit and provides a learning space where the nature of mathematics and mathematical practices are linked to natural science. (shrink)

One of the traditional ways mathematical ideas and even new areas of mathematics are created is from experiments. One of the best-known examples is that of the Fermat hypothesis, which was conjectured by Fermat in his attempts to find integer solutions for the famous Fermat equation. This hypothesis led to the creation of a whole field of knowledge, but it was proved only after several hundred years. This book, based on the author's lectures, presents several new directions of (...) class='Hi'>mathematical research. All of these directions are based on numerical experiments conducted by the author, which led to new hypotheses that currently remain open, i.e., are neither proved nor disproved. The hypotheses range from geometry and topology (statistics of plane curves and smooth functions) to combinatorics (combinatorial complexity and random permutations) to algebra and number theory (continuous fractions and Galois groups). For each subject, the author describes the problem and presents numerical results that led him to a particular conjecture. In the majority of cases there is an indication of how the readers can approach the formulated conjectures (at least by conducting more numerical experiments). Written in Arnold's unique style, the book is intended for a wide range of mathematicians, from high school students interested in exploring unusual areas of mathematics on their own, to college and graduate students, to researchers interested in gaining a new, somewhat nontraditional perspective on doing mathematics. In the interest of fostering a greater awareness and appreciation of mathematics and its connections to other disciplines and everyday life, MSRI and the AMS are publishing books in the Mathematical Circles Library series as a service to young people, their parents and teachers, and the mathematics profession. Titles in this series are co-published with the Mathematical Sciences Research Institute (MSRI). (shrink)

ABSTRACT A computational logic, PLPR (Predicate Logic using Polymorphism and Recursion) is presented. Actually this logic is the object language of an automated deduction system designed as a tool for proving mathematical theorems as well as specify and verify properties of functional programs. A useful denotationl semantics and two general deduction methods for PLPR are defined. The first one is a tableau algorithm proved to be complete and also used as a guideline for building complete calculi. The second is (...) a sound and complete natural deduction system. Moreover a fixed point induction rule is introduced for formulas called continuous. The strategies for mechanizing the proofs of the final automated system are based on the previous deduction methods. As the examples of the use of the system show, the implemented theorem prover outperforms humans to a certain extent, retaining logic and calculi generality. (shrink)