Hilbert's Program Then and Now

Hilbert's program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to "dispose of the foundational questions in mathematics once and for all, "Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, "finitary" means, one should give proofs of the consistency of these axiomatic systems. Although Godel's incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial successes, and generated important advances in logical theory and meta-theory, both at the time and since. The article discusses the historical background and development of Hilbert's program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s.Comment: 43 page

Ten Misconceptions from the History of Analysis and Their Debunking

The widespread idea that infinitesimals were "eliminated" by the "great triumvirate" of Cantor, Dedekind, and Weierstrass is refuted by an uninterrupted chain of work on infinitesimal-enriched number systems. The elimination claim is an oversimplification created by triumvirate followers, who tend to view the history of analysis as a pre-ordained march toward the radiant future of Weierstrassian epsilontics. In the present text, we document distortions of the history of analysis stemming from the triumvirate ideology of ontological minimalism, which identified the continuum with a single number system. Such anachronistic distortions characterize the received interpretation of Stevin, Leibniz, d'Alembert, Cauchy, and others.Comment: 46 pages, 4 figures; Foundations of Science (2012). arXiv admin note: text overlap with arXiv:1108.2885 and arXiv:1110.545

A Burgessian critique of nominalistic tendencies in contemporary mathematics and its historiography

We analyze the developments in mathematical rigor from the viewpoint of a Burgessian critique of nominalistic reconstructions. We apply such a critique to the reconstruction of infinitesimal analysis accomplished through the efforts of Cantor, Dedekind, and Weierstrass; to the reconstruction of Cauchy's foundational work associated with the work of Boyer and Grabiner; and to Bishop's constructivist reconstruction of classical analysis. We examine the effects of a nominalist disposition on historiography, teaching, and research.Comment: 57 pages; 3 figures. Corrected misprint

Computational reverse mathematics and foundational analysis

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert's program due to Simpson [1988], and predicativism in the extended form due to Feferman and Sch\"{u}tte. Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only $\omega$-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a $\Pi^1_1$ complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than $\Pi^1_1\text{-}\mathsf{CA}_0$.Comment: Submitted. 41 page

Developing transferable management skills through Action Learning

There has been increasing criticism of the relevance of the Master of Business Administration (MBA) in developing skills and competencies. Action learning, devised to address problem-solving in the workplace, offers a potential response to such criticism. This paper offers an insight into one university’s attempt to integrate action learning into the curriculum. Sixty-five part-time students were questioned at two points in their final year about their action learning experience and the enhancement of relevant skills and competencies. Results showed a mixed picture. Strong confirmation of the importance of selected skills and competencies contrasted with weaker agreement about the extent to which these were developed by action learning. There was, nonetheless, a firm belief in the positive impact on the learning process. The paper concludes that action learning is not a panacea but has an important role in a repertoire of educational approaches to develop relevant skills and competencies

Infinity

This essay surveys the different types of infinity that occur in pure and applied mathematics, with emphasis on: 1. the contrast between potential infinity and actual infinity; 2. Cantor's distinction between transfinite sets and absolute infinity; 3. the constructivist view of infinite quantifiers and the meaning of constructive proof; 4. the concept of feasibility and the philosophical problems surrounding feasible arithmetic; 5. Zeno's paradoxes and modern paradoxes of physical infinity involving supertasks

On Exact and Approximate Solutions for Hard Problems: An Alternative Look

We discuss in an informal, general audience style the da Costa-Doria conjecture about the independence of the P = NP hypothesis and try to briefly assess its impact on practical situations in economics. The paper concludes with a discussion of the Coppe-Cosenza procedure, which is an approximate, partly heuristic algorithm for allocation problems.P vs. NP , allocation problem, assignment problem, traveling salesman, exact solution for NP problems, approximate solutions for NP problems, undecidability, incompleteness

Introduction to Abstractionism

First paragraph: Abstractionism in philosophy of mathematics has its origins in Gottlob Frege’s logicism—a position Frege developed in the late nineteenth and early twentieth century. Frege’s main aim was to reduce arithmetic and analysis to logic in order to provide a secure foundation for mathematical knowledge. As is well known, Frege’s development of logicism failed. The infamous Basic Law V— one of the six basic laws of logic Frege proposed in his magnum opus Grundgesetze der Arithmetik—is subject to Russell’s Paradox. The striking feature of Frege’s Basic Law V is that it takes the form of an abstraction principle

BASIC LOGICAL KNOWLEDGE AND ITS JUSTIFICATION

This thesis contributes to the area within the philosophy of logic that concerns epistemological questions about fundamental logical laws. The state of the literature has been dominated by meaning-theoretic approaches that attempt to answer such questions in terms of conditions for understanding words or for possessing concepts, and empiricist approaches that attempt to characterize logical knowledge as a posteriori. The theoretical contribution made by my work amounts to the presentation of an alternative theory that does not appeal to the notion of rational insight, and which is not psychologistic, conventionalist, or inductivist. The theory that I propose involves a philosophical analysis of logical concepts which facilitates a transcendental argument in support of basic logical knowledge. I arrive at this theory by radically readapting methods and insights from the theories of geometry of Kant and Helmholtz, and from Frege’s logicist explanation of the basis of our knowledge of arithmetic. I argue that the meaning-theoretic approaches of Christopher Peacocke and Paul Boghossian overestimate the epistemological power of the conditions for understanding logical constants. I argue that the naturalistic approach of Penelope Maddy is psychologistic. To lay the groundwork for my own proposal 1 investigate the role of Kant’s transcendental method in his theory of geometry, and the role of the theory of analytic definitions in a reconstruction of Frege’s logicism. My own proposal posits that logical laws are analytic of logical concepts, and that logical concepts are conditions of the possibility of possessing a minimally reasonable conceptual scheme

Number skills and knowledge in children with specific language impairment

The number skills of groups of 7 to 9 year old children with specific language impairment (SLI) attending mainstream or special schools are compared with an age and nonverbal reasoning matched group (AC), and a younger group matched on oral language comprehension. The SLI groups performed below the AC group on every skill. They also showed lower working memory functioning and had received lower levels of instruction. Nonverbal reasoning, working memory functioning, language comprehension, and instruction accounted for individual variation in number skills to differing extents depending on the skill. These factors did not explain the differences between SLI and AC groups on most skills