The article examines how Salomon Maimon’s concept of number as ratio can be used to demonstrate that arithmetical judgments are analytical. Based on his critique of Kant’s synthetic a priori judgments, I show how this notion of number fulfills Maimon’s requirements for apodictic knowledge. Moreover, I suggest that Maimon was influenced by mathematicians who previously defined number as a ratio, such as Wallis and Newton. Following an analysis of the real definition of this concept, I conclude that within the (...) framework of Maimon’s philosophy, arithmetical judgments cannot be analytical, nor is arithmetic an objectively necessary science, but rather only subjectively necessary. We should also cast doubt on his claim that we can create real objects from pure concepts of the understanding. (shrink)

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is (...) mistaken: supertasks are of no help in explaining arithmetical determinacy. (shrink)

What is the nature of number systems and arithmetic that we use in science for quantification, analysis, and modeling? I argue that number concepts and arithmetic are neither hardwired in the brain, nor do they exist out there in the universe. Innate subitizing and early cognitive preconditions for number— which we share with many other species—cannot provide the foundations for the precision, richness, and range of number concepts and simple arithmetic, let alone that of more complex (...) mathematical concepts. Numbers and arithmetic, and mathematics in general, have unique features—precision, objectivity, rigor, generalizability, stability, symbolizability, and applicability to the real world—that must be accounted for. They are sophisticated concepts that developed culturally only in recent human history. I suggest that numbers and arithmetic are realized through precise combinations of non-mathematical everyday cognitive mechanisms that make human imagination and abstraction possible. One such mechanism, conceptual metaphor, is a neurally instantiated inference-preserving cross-domain mapping that allows the conceptualization of abstract entities in terms of grounded bodily experience. I analyze how the inferential organization of the properties and “laws” of arithmetic emerge metaphorically from everyday meaningful actions. Numbers and arithmetic are thus—outside of natural selection—the product of the biologically constrained interaction of individuals with the appropriate cultural and historical phenotypic variation supported by language, writing systems, and education. (shrink)

The lack of conceptual analysis within cognitive science results in multiple models of the same phenomena. However, these models incorporate assumptions that contradict basic structural features of the domain they are describing. This is particularly true about the domain of mathematical cognition. In this paper we argue that foundational theoretic aspects of psychological models for language and arithmetic should be clarified before postulating such models. We propose a means to clarify these foundational concepts by analyzing the distinctions between (...) metric and linguistic compositionality, which we use to assess current models of mathematical cognition. Our proposal is consistent with the scientific methodology that determines that careful conceptual analysis should precede theoretical descriptions of data. 2012 APA, all rights reserved). (shrink)

A growing body of research has shown that symbolic number processing relates to individual differences in mathematics. However, it remains unclear which mechanisms of symbolic number processing are crucial—accessing underlying magnitude representation of symbols (i.e., symbol‐magnitude associations), processing relative order of symbols (i.e., symbol‐symbol associations), or processing of symbols per se. To address this question, in this study adult participants performed a dots‐number word matching task—thought to be a measure of symbol‐magnitude associations (numerical magnitude processing)—a numeral‐ordering task that focuses on (...) symbol‐symbol associations (numerical order processing), and a digit‐number word matching task targeting symbolic processing per se. Results showed that both numerical magnitude and order processing were uniquely related to arithmetic achievement, beyond the effects of domain‐general factors (intellectual ability, working memory, inhibitory control, and non‐numerical ordering). Importantly, results were different when a general measure of mathematics achievement was considered. Those mechanisms of symbolic number processing did not contribute to math achievement. Furthermore, a path analysis revealed that numerical magnitude and order processing might draw on a common mechanism. Each process explained a portion of the relation of the other with arithmetic (but not with a general measure of math achievement). These findings are consistent with the notion that adults’ arithmetic skills build upon symbol‐magnitude associations, and they highlight the effects that different math measures have in the study of numerical cognition. (shrink)

Theorems of hyperarithmetic analysis occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed iterations of the Turing jump but below ATR $_{0}$. There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in graphs. (...) They seem to be typical applications of ACA $_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis. When combined with ACA $_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes are defined and these ATHAs as well as many other principles are shown to be conservative over RCA $_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic. (shrink)

Resumo: o propósito desse artigo é circunscrever e discutir a autocrítica, feita por Wittgenstein no período de 1933-39, a uma das teses mais fundamentais do Tractatus (TLP): ”Há uma e apenas uma análise completa da proposição” (3.25). Chamaremos esse procedimento peculiar de a “Grande análise”. Os argumentos de Wittgenstein contra a sustentabilidade da sua antiga tese podem ser encontrados em algumas passagens do livro Investigações Filosóficas (IF), bem como em passagens do Grande Datiloscrito (BT). Conforme será argumentado nesse artigo, essa (...) autocrítica é uma consequência direta da preocupação de Wittgenstein, no período intermediário, com duas importantes propostas feitas por Frege nos §§18-24 do Os Fundamentos da Aritmética (FA) em relação o seu entendimento da noção de “atribuição numérica”. Nosso objetivo principal será mostrar de que maneira o movimento de autocrítica feito por Wittgenstein em relação a sua antiga concepção de “Grande Análise” teria sido influenciado por suas preocupações, no período intermediário de sua obra, com essas duas propostas feita por Frege no FA a respeito da noção de “atribuição numérica”. A fim de completar tal tarefa, será apresentada inicialmente de modo breve uma versão de como seria a “Grande análise” no TLP. Em seguida, selecionaremos e discutiremos algumas passagens do IF nas quais Wittgenstein recusa a completude e unicidade envolvida em sua prévia concepção tratariana de “análise”. Procuraremos destacar com clareza uma noção que estaria envolvida de um modo essencial na autocrítica de Wittgenstein: a noção de “ver como/ver aspectos”. Como será argumentado, essa noção, assim como a autocrítica feita por Wittgenstein, foram ambas diretamente influenciadas pela noção fregiana de “atribuição numérica”. Para completar essa segunda tarefa, teremos de revisitar e discutir algumas noções pertencentes ao período inicial da filosofia de Wittgenstein -- como a de “propriedades internas e externas” e a distinção entre “dizer e mostrar” -- ambas noções discutidas no TLP. No decorrer de nossa discussão, apresentaremos uma crítica feita por Wittgenstein a Russell, mas também a Frege, sobre a concepção de generalidade, ou mais especificamente, sobre o uso do quantificador existencial, proposta por ambos. Abstract: The purpose of this article is to discuss Wittgenstein 1933-39 self-criticism of one of the most fundamental tractarian theses: There is one and only one complete analysis of the proposition (3.25). Wittgenstein's arguments against his previous thesis can be found in some passages of the Philosophical Investigation (PI) as well as in the Big Typescript (BT). As we shall argue, Wittgenstein's self-critique is directly related to two important ideas proposed by Frege in §§18-24 of The Foundations Arithmetic (FA) with respect to his construal of “number attributions”. Our main goal in this paper will therefore be to show how Wittgenstein's self-criticism of his old conception of the tractarian “analysis” would have been influenced by his concerns in the middle period of his work with these two proposals made by Frege in FA regarding the notion of “numerical attribution”. Our first task will then be to connect Wittgenstein's self-criticisms to his former conception of “analysis” in the Tractatus Logico-Philosophicus (TLP). To accomplish this first goal, we will have to briefly present a version of how such analysis would look like in TLP. Our next task will be to pinpoint some passages of the PI in which Wittgenstein rejects the completeness and uniqueness involved in his previous construal of the analytical process. We will try to circumscribe clearly a crucial notion involved in Wittgenstein's self-critique: the idea of “seeing as/seeing aspects”. Our claim is that this notion, as well as Wittgenstein's self-criticism, were both directly influenced by Frege's construal of the “number attribution” presented in FA. To accomplish this second task, we will have to revisit and discuss some further concepts from an early period of Wittgenstein's philosophy, like “internal and internal properties” and the “saying/showing distinction” in TLP. On our way towards accomplishing this goal, we will present a curious complaint by Wittgenstein regarding Russell's, as well as Frege's conception of generality, or more specifically, on the usage of the existential quantifier suggested by both these authors. (shrink)

A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched.

A new method of "minimal" realizability is proposed and applied to show that the definable functions of Heyting arithmetic (HA)--functions f such that HA $\vdash \forall x\exists!yA(x, y)\Rightarrow$ for all m, A(m, f(m)) is true, where A(x, y) may be an arbitrary formula of L(HA) with only x, y free--are precisely the provably recursive functions of the classical Peano arithmetic (PA), i.e., the $ -recursive functions. It is proved that, for prenex sentences provable in HA, Skolem functions may (...) always be chosen to be $ -recursive. The method is extended to intuitionistic finite-type arithmetic, HA ω 0 , and elementary analysis. Generalized forms of Kreisel's characterization of the provably recursive functions of PA and of the no-counterexample-interpretation for PA are consequently derived. (shrink)

We discuss the philosophical status of the statement that (9n – 1) is divisible by 8 for various sizes of the number n. We argue that even this simple problem reveals deep tensions between truth and verification. Using Gillies's empiricist classification of theories into levels, we propose that statements in arithmetic should be classified into three different levels depending on the sizes of the numbers involved. We conclude by discussing the relationship between the real number system and the physical (...) continuum. (shrink)

This paper provides examples in arithmetic of the account of rational intuition and evidence developed in my book After Gödel: Platonism and Rationalism in Mathematics and Logic . The paper supplements the book but can be read independently of it. It starts with some simple examples of problem-solving in arithmetic practice and proceeds to general phenomenological conditions that make such problem-solving possible. In proceeding from elementary ‘authentic’ parts of arithmetic to axiomatic formal arithmetic, the paper exhibits (...) some elements of the genetic analysis of arithmetic knowledge that is called for in Husserl’s philosophy. This issues in an elaboration on a number of Gödel’s remarks about the meaning of his incompleteness theorems for the notion of evidence in mathematics. (shrink)

One of the most noticeable features of the book of Revelation is the ubiquity of arithmetic in the text. In this article, I survey the arithmetical functions found in the text (not only numbers but functions such as multiplication and applied mathematics, such as measurements), and note some patterns in John’s use of numbers. Then the article explores precedents in the Hebrew Scriptures, Hellenistic culture (including astrology) and Jewish apocalyptic literature. I argue rhetorical criticism helps us identify what John (...) is trying to do with his apocalyptic arithmetic. I draw on theological analysis, literary analysis (particularly the “writerly” nature of the text with its missing pieces for the audience to fill in) and especially intertextuality to understand his rhetorical strategy. I discuss various numbers but focus especially on ten and two passages (Rev 14:20 and 12:1-6) as examples of John’s use of numbers and arithmetical functions. I conclude that John uses arithmetic to support his Christocentric narrative and worldview in addressing his Jewish and Greek audience. (shrink)

One of the most noticeable features of the book of Revelation is the ubiquity of arithmetic in the text. In this article, I survey the arithmetical functions found in the text (not only numbers but functions such as multiplication and applied mathematics, such as measurements), and note some patterns in John’s use of numbers. Then the article explores precedents in the Hebrew Scriptures, Hellenistic culture (including astrology) and Jewish apocalyptic literature. I argue rhetorical criticism helps us identify what John (...) is trying to do with his apocalyptic arithmetic. I draw on theological analysis, literary analysis (particularly the “writerly” nature of the text with its missing pieces for the audience to fill in) and especially intertextuality to understand his rhetorical strategy. I discuss various numbers but focus especially on ten and two passages (Rev 14:20 and 12:1-6) as examples of John’s use of numbers and arithmetical functions. I conclude that John uses arithmetic to support his Christocentric narrative and worldview in addressing his Jewish and Greek audience. (shrink)

The incompleteness of formal systems for arithmetic has been a recognized fact of mathematics. The term “incompleteness” suggests that the formal system in question fails to offer a deduction which it ought to. This chapter focuses on the status of a formal system, Peano Arithmetic, and explores a viewpoint on which Peano Arithmetic occupies an intrinsic, conceptually well-defined region of arithmetical truth. The idea is that it consists of those truths which can be perceived directly from the (...) purely arithmetical content of a categorical conceptual analysis of the notion of natural number. The chapter explores its conceptual stability in light of the apparently destabilizing effect, through extensibility, of the phenomenon of incompleteness. It also offers heuristic and conceptual support for the viewpoint that Peano Arithmetic is the strongest natural first-order system for arithmetic, and that there is a sense in which it is complete with respect to purely arithmetical truth. (shrink)

This article aims first at showing that Russell's general doctrine according to which all mathematics is deducible ‘by logical principles from logical principles’ does not require a preliminary reduction of all mathematics to arithmetic. In the Principles, mechanics (part VII), geometry (part VI), analysis (part IV–V) and magnitude theory (part III) are to be all directly derived from the theory of relations, without being first reduced to arithmetic (part II). The epistemological importance of this point cannot be (...) overestimated: Russell's logicism does not only contain the claim that mathematics is no more than logic, it also contains the claim that the differences between the various mathematical sciences can be logically justified—and thus, that, contrary to the arithmetization stance, analysis, geometry and mechanics are not merely outgrowths of arithmetic. The second aim of this article is to set out the neglected Russellian theory of quantity. The topic is obviously linked with the first, since the mere existence of a doctrine of magnitude, in a work dated from 1903, is a sign of a distrust vis-à-vis the arithmetization programme. After having shown that, despite the works of Cantor, Dedekind and Weierstrass, many mathematicians at the end of the 19th Century elaborated various axiomatic theories of the magnitude, I will try to define the peculiarity of the Russellian approach. I will lay stress on the continuity of the logicist's thought on this point: Whitehead, in the Principia, deepens and generalizes the first Russellian 1903 theory. (shrink)

There is evidence in Kant of the idea that concepts of particular numbers, such as the number 5, are derived from the representation of units, and in particular pure units, that is, units that are qualitatively indistinguishable. Frege, in contrast, rejects any attempt to derive concepts of number from the representation of units. In the Foundations of Arithmetic, he softens up his reader for his groundbreaking and unintuitive analysis of number by attacking alternative views, and he devotes the (...) majority of this attack to the units view, with particular attention to pure units. Since Frege, the units view has been all but abandoned. Nevertheless, the idea that concepts of number are derived from the representation of units has a long history, beginning with the ancient Greeks, and was prevalent among Frege's contemporaries. I am not interested in resurrecting the units view or in righting wrongs in Frege's criticisms of his contemporaries. Rather, I am interested in the program of deriving concepts of number from pure units and its history from Kant to Frege. An examination of that history helps us understand the units view in a way that Frege's criticisms do not, and in the process uncovers important features of both Kant's and Frege's views. I will argue that, although they had deep differences, Kant and Frege share assumptions about what such a view would require and about the limits of conceptual representation. I will also argue that they would have rejected the accounts given by some of Frege's contemporaries for the same reasons. Despite these agreements, however, there is evidence that Kant thinks that space and time play a role in overcoming the limitations of conceptual representation, while Frege argues that they do not. (shrink)

With the arrival of the nineteenth century, a process of change guided the treatment of three basic elements in the development of mathematics: rigour, the arithmetization and the clarification of the concept of function, categorised as the most important tool in the development of the mathematical analysis. In this paper we will show how several prominent mathematicians contributed greatly to the development of these basic elements that allowed the solid underpinning of mathematics and the consideration of mathematics as an (...) axiomatic way of thinking in which anyone can deduce valid conclusions from certain types of premises. This nineteenth century stage shares, possibly with the Heroic Age of Ancient Greece, the most revolutionary period in all history of mathematics. (shrink)

We give a constructive analysis of learning as it arises in various computational interpretations of classical Peano Arithmetic, such as Aschieri and Berardi learning based realizability, Avigad’s update procedures and epsilon substitution method. In particular, we show how to compute in Gödel’s system T upper bounds on the length of learning processes, which are themselves represented in T through learning based realizability. The result is achieved by the introduction of a new non standard model of Gödel’s T, whose (...) new basic objects are pairs of non standard natural numbers and moduli of convergence, where the latter are objects giving constructive information about the former. As a foundational corollary, we obtain that that learning based realizability is a constructive interpretation of Heyting Arithmetic plus excluded middle over Σ10 formulas and of all Peano Arithmetic when combined with Gödel’s double negation translation. As a byproduct of our approach, we also obtain a new proof of Avigad’s theorem for update procedures and thus of the termination of the epsilon substitution method for PA. (shrink)

In this paper we apply the idea of Revision Rules, originally developed within the framework of the theory of truth and later extended to a general mode of definition, to the analysis of the arithmetical hierarchy. This is also intended as an example of how ideas and tools from philosophical logic can provide a different perspective on mathematically more “respectable” entities. Revision Rules were first introduced by A. Gupta and N. Belnap as tools in the theory of truth, and (...) they have been further developed to provide the foundations for a general theory of (possibly circular) definitions. Revision Rules are non-monotonic inductive operators that are iterated into the transfinite beginning with some given “bootstrapper” or “initial guess.” Since their iteration need not give rise to an increasing sequence, Revision Rules require a particular kind of operation of “passage to the limit,” which is a variation on the idea of the inferior limit of a sequence. We then define a sequence of sets of strictly increasing arithmetical complexity, and provide a representation of these sets by means of an operator G(x, φ) whose “revision” is carried out over ω2 beginning with any total function satisfying certain relatively simple conditions. Even this relatively simple constraint is later lifted, in a theorem whose proof is due to Anil Gupta. (shrink)

In his monograph On Numbers and Games, J. H. Conway introduced a real-closed field containing the reals and the ordinals as well as a great many less familiar numbers including $-\omega, \,\omega/2, \,1/\omega, \sqrt{\omega}$ and $\omega-\pi$ to name only a few. Indeed, this particular real-closed field, which Conway calls No, is so remarkably inclusive that, subject to the proviso that numbers—construed here as members of ordered fields—be individually definable in terms of sets of NBG, it may be said to contain (...) “All Numbers Great and Small.” In this respect, No bears much the same relation to ordered fields that the system ℝ of real numbers bears to Archimedean ordered fields. In Part I of the present paper, we suggest that whereas $\mathbb{R}$should merely be regarded as constituting an arithmetic continuum, No may be regarded as a sort of absolute arithmetic continuum, and in Part II we draw attention to the unifying framework No provides not only for the reals and the ordinals but also for an array of non-Archimedean ordered number systems that have arisen in connection with the theories of non-Archimedean ordered algebraic and geometric systems, the theory of the rate of growth of real functions and nonstandard analysis. In addition to its inclusive structure as an ordered field, the system No of surreal numbers has a rich algebraico-tree-theoretic structure—a simplicity hierarchical structure—that emerges from the recursive clauses in terms of which it is defined. In the development of No outlined in the present paper, in which the surreals emerge vis-à-vis a generalization of the von Neumann ordinal construction, the simplicity hierarchical features of No are brought to the fore and play central roles in the aforementioned unification of systems of numbers great and small and in some of the more revealing characterizations of No as an absolute continuum. (shrink)

We develop fundamental aspects of the theory of metric, Hilbert, and Banach spaces in the context of subsystems of second-order arithmetic. In particular, we explore issues having to do with distances, closed subsets and subspaces, closures, bases, norms, and projections. We pay close attention to variations that arise when formalizing definitions and theorems, and study the relationships between them.

This paper has three goals: (i) to show that the foundational program begun in the Begriffsschroft, and carried forward in the Grundlagen, represented Frege's attempt to establish the autonomy of arithmetic from geometry and kinematics; the cogency and coherence of 'intuitive' reasoning were not in question. (ii) To place Frege's logicism in the context of the nineteenth century tradition in mathematical analysis, and, in particular, to show how the modern concept of a function made it possible for Frege (...) to pursue the goal of autonomy within the framework of the system of second-order logic of the Begriffsschrift. (iii) To address certain criticisms of Frege by Parsons and Boolos, and thereby to clarify what was and was not achieved by the development, in Part III of the Begriffsschrift, of a fragment of the theory of relations. (shrink)

This paper describes both an exegetical puzzle that lies at the heart of Frege’s writings—how to reconcile his logicism with his definitions and claims about his definitions—and two interpretations that try to resolve that puzzle, what I call the “explicative interpretation” and the “analysis interpretation.” This paper defends the explicative interpretation primarily by criticizing the most careful and sophisticated defenses of the analysis interpretation, those given my Michael Dummett and Patricia Blanchette. Specifically, I argue that Frege’s text either (...) are inconsistent with the analysis interpretation or do not support it. I also defend the explicative interpretation from the recent charge that it cannot make sense of Frege’s logicism. While I do not provide the explicative interpretation’s full solution to the puzzle, I show that its main competitor is seriously problematic. (shrink)

To analyze the task of mental arithmetic with external representations in different number systems we model algorithms for addition and multiplication with Arabic and Roman numerals. This demonstrates that Roman numerals are not only informationally equivalent to Arabic ones but also computationally similar—a claim that is widely disputed. An analysis of our models' elementary processing steps reveals intricate tradeoffs between problem representation, algorithm, and interactive resources. Our simulations allow for a more nuanced view of the received wisdom on (...) Roman numerals. While symbolic computation with Roman numerals requires fewer internal resources than with Arabic ones, the large number of needed symbols inflates the number of external processing steps. (shrink)

Frege writes in Numbers and Arithmetic about kindergarten-numbers and “an a priori mode of cognition” that they may have “a geometrical source.” This resembles recent findings on arithmetical cognition. In my paper, I explore this resemblance between Gottlob Frege’s later position concerning the geometrical source of arithmetical knowledge, and some current positions in the literature dedicated to arithmetical cognition, especially that of Stanislas Dehaene. In my analysis, I shall try to mainly see to what extent (Frege’s) logicism is (...) compatible with (Dehaene’s) intuitionism. (shrink)

Frege's scathing comments on Mill on the empirical grounds of arithmetical truth are elaborated. The suggestion is made that some entities are ‘well-behaved' : if you perform two acts and then two more, the ‘result' will be that exactly four acts have occurred. How much it all matters or means is not further discussed.

In this paper, we show within ${\mathsf{RCA}_0}$ that both the Jordan curve theorem and the Schönflies theorem are equivalent to weak König’s lemma. Within ${\mathsf {WKL}_0}$ , we prove the Jordan curve theorem using an argument of non-standard analysis based on the fact that every countable non-standard model of ${\mathsf {WKL}_0}$ has a proper initial part that is isomorphic to itself (Tanaka in Math Logic Q 43:396–400, 1997).

In this paper, we introduce systems of nonstandard second-order arithmetic which are conservative extensions of systems of second-order arithmetic. Within these systems, we do reverse mathematics for nonstandard analysis, and we can import techniques of nonstandard analysis into analysis in weak systems of second-order arithmetic. Then, we apply nonstandard techniques to a version of Riemannʼs mapping theorem, and show several different versions of Riemannʼs mapping theorem.

Arithmetical cognition is the result of enculturation. On a personal level of analysis, enculturation is a process of structured cultural learning that leads to the acquisition of evolutionarily recent, socio-culturally shaped arithmetical practices. On a sub-personal level, enculturation is realized by learning driven plasticity and learning driven bodily adaptability, which leads to the emergence of new neural circuitry and bodily action patterns. While learning driven plasticity in the case of arithmetical practices is not consistent with modularist theories of mental (...) architecture, it can be enriched by the theory of neural reuse. According to neural reuse, cerebral regions are reused to contribute to multiple neural circuits in functionally constrained ways throughout ontogeny. By hypothesis, learning driven plasticity is complemented by learning driven bodily adaptability, which suggests that there is an interesting functional relationship between finger gnosis, finger counting, and arithmetical practices. The emerging perspective on enculturated arithmetical cognition will be complemented by considerations on associated developmental and acquired disorders, namely developmental dyscalculia and acquired acalculia. The upshot is that we need to take the cerebral, extra-cerebral bodily, and socio-cultural dimensions of enculturation into account in order to arrive at a better understanding of the phylogenetic and ontogenetic conditions of arithmetical cognition. (shrink)

According to the implicit commitment thesis, once accepting a mathematical formal system S, one is implicitly committed to additional resources not immediately available in S. Traditionally, this thesis has been understood as entailing that, in accepting S, we are bound to accept reflection principles for S and therefore claims in the language of S that are not derivable in S itself. It has recently become clear, however, that such reading of the implicit commitment thesis cannot be compatible with well-established positions (...) in the foundations of mathematics which consider a specific theory S as self-justifying and doubt the legitimacy of any principle that is not derivable in S: examples are Tait’s finitism and the role played in it by Primitive Recursive Arithmetic, Isaacson’s thesis and Peano Arithmetic, Nelson’s ultrafinitism and sub-exponential arithmetical systems. This casts doubts on the very adequacy of the implicit commitment thesis for arithmetical theories. In the paper we show that such foundational standpoints are nonetheless compatible with the implicit commitment thesis. We also show that they can even be compatible with genuine soundness extensions of S with suitable form of reflection. The analysis we propose is as follows: when accepting a system S, we are bound to accept a fixed set of principles extending S and expressing minimal soundness requirements for S, such as the fact that the non-logical axioms of S are true. We call this invariant component the semantic core of implicit commitment. But there is also a variable component of implicit commitment that crucially depends on the justification given for our acceptance of S in which, for instance, may or may not appear reflection principles for S. We claim that the proposed framework regulates in a natural and uniform way our acceptance of different arithmetical theories. (shrink)

The Heisenberg-Gabor uncertainty principle defines the limits of information resolution in both time and frequency domains. The limit of resolution discloses unique properties of a time series by frequency decomposition. However, classical methods such as Fourier analysis are limited by spectral leakage, particularly in longitudinal data with shifting periodicity or unequal intervals. Wavelet transformation provides a workable compromise by decomposing the signal in both time and frequency through translation and scaling of a basis function followed by correlation or convolution (...) with the original signal. This study aimed to compare the accuracy of predictive models in mental arithmetic in time and frequency domains. Analysis of the author's response time at mental arithmetic using a soroban was modeled for two periods, an initial period, and a return period both separated by an interval of 370 days. The median response times in seconds was longer for all tasks during the TI compared to the TR period, for addition [CTAdd 62 vs 50 s] and summation [CTSum 68 vs 57 s]. Response times were longer for errors regardless of the study period or task. There was an increasing phase difference for the addition and summation tasks during the TI period toward the end of the series 49.65o compared to the TR period where the phase difference between the two tasks was only 2.05o, indicating that both tasks are likely demonstrating similar learning rates during the latter study period. A comparison between time and time/frequency domain forecasts for an additional 100 tasks demonstrated higher accuracy of the maximum overlap discrete wavelet transform model, where the mean absolute percentage error ranged between 5.48 and 8.19% and that for the time domain models [autoregressive integrated moving average, generalized autoregressive conditional heteroscedasticity ] was 6.16–10.80%. (shrink)

The first complete English translation of a groundbreaking work. An ambitious account of the relation of mathematics to logic. Includes a foreword by Crispin Wright, translators' Introduction, and an appendix on Frege's logic by Roy T. Cook. The German philosopher and mathematician Gottlob Frege (1848-1925) was the father of analytic philosophy and to all intents and purposes the inventor of modern logic. Basic Laws of Arithmetic, originally published in German in two volumes (1893, 1903), is Freges magnum opus. It (...) was to be the pinnacle of Freges lifes work. It represents the final stage of his logicist project the idea that arithmetic and analysis are reducible to logic and contains his mature philosophy of mathematics and logic. The aim of Basic Laws of Arithmetic is to demonstrate the logical nature of mathematical theorems by providing gapless proofs in Frege's formal system using only basic laws of logic, logical inference, and explicit definitions. The work contains a philosophical foreword, an introduction to Frege's logic, a derivation of arithmetic from this logic, a critique of contemporary approaches to the real numbers, and the beginnings of a logicist treatment of real analysis. As is well-known, a letter received from Bertrand Russell shortly before the publication of the second volume made Frege realise that his basic law V, governing the identity of value-ranges, leads into inconsistency. Frege discusses a revision to basic law V written in response to Russells letter in an afterword to volume II. The continuing importance of Basic Laws of Arithmetic lies not only in its bearing on issues in the foundations of mathematics and logic but in its model of philosophical inquiry. Frege's ability to locate the essential questions, his integration of logical and philosophical analysis, and his rigorous approach to criticism and argument in general are vividly in evidence in this, his most ambitious work. Philip Ebert and Marcus Rossberg present the first full English translation of both volumes of Freges major work preserving the original formalism and pagination. The edition contains a foreword by Crispin Wright and an extensive appendix providing an introduction to Frege's formal system by Roy T. Cook. Readership: Scholars and advanced students in philosophy of logic, philosophy of mathematics, and early analytic philosophy. (shrink)

Ratajczyk, Z., Subsystems of true arithmetic and hierarchies of functions, Annals of Pure and Applied Logic 64 95–152. The combinatorial method coming from the study of combinatorial sentences independent of PA is developed. Basing on this method we present the detailed analysis of provably recursive functions associated with higher levels of transfinite induction, I, and analyze combinatorial sentences independent of I. Our treatment of combinatorial sentences differs from the one given by McAloon [18] and gives more natural sentences. (...) The same method give also a combinatorial technique with no use of the cut-elimination theorem which is appropriate to study proof-theoretic strength of subsystems of first order arithmetic and some of their expansions. It was used to analyze iterated reflection principle and system of transfinite induction with a satisfaction class. (shrink)

There is an influential, ongoing debate between traditionalists and experimentalists about how to carry out conceptual analysis by means of the method of possible cases. The debate concerns whose intuitions are evidentially relevant to philosophical theories, and which methods are most appropriate for collecting such evidence. The aim of this paper is not to take sides in this debate, but to question the monopoly that the method of possible cases has in contemporary discussions of philosophical methodology. Since early analytic (...) philosophy is replete with methods of conceptual analysis that make no essential use of intuitions, these discussions are inevitably myopic. In particular, it will be argued that Frege’s logical analysis of arithmetic, Hilbert’s axiomatic analysis of geometry, and Poincaré’s transcendental analysis of physics are non-psychologistic methods that yield profound philosophical conclusions. None of these methods are carried out from the philosopher’s armchair or the scientist’s laboratory; instead they properly belong to mathematics and physics. Thus, by ignoring these methods, both traditionalists and experimentalists have neglected the significant role that the exact sciences can play in conceptual analysis. (shrink)

This paper introduces an extension A of Kleene's axiomatization of Brouwer's intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(α) on Baire space with the property that every constructive partial functional defined on {α : R(α)} is continuous there. The domains of continuity for A coincide with the stable relations (those equivalent in A to their double negations), while every relation (...) R(α) is equivalent in A to ∃αA(α, β) for some stable A(α, β) (which belongs to the classical analytical hierarchy). The logic of A is intuitionistic. The axioms of A include countable comprehension, bar induction, Troelstra's generalized continuous choice, primitive recursive Markov's Principle and a classical axiom of dependent choices proposed by Krauss. Constructive dependent choices, and constructive and classical countable choice, are theorems, A is maximal with respect to classical Kleene function realizability, which establishes its consistency. The usual disjunction and (recursive) existence properties ensure that A preserves the constructive sense of "or" and "there exists.". (shrink)

_The Foundations of Arithmetic_ is undoubtedly the best introduction to Frege's thought; it is here that Frege expounds the central notions of his philosophy, subjecting the views of his predecessors and contemporaries to devastating analysis. The book represents the first philosophically sound discussion of the concept of number in Western civilization. It profoundly influenced developments in the philosophy of mathematics and in general ontology.

This paper considers the use of secondary data analysis in educational research. It addresses some of the promises and potential pitfalls that influence its use and explores a possible role for the secondary analysis of numeric data in the 'new' political arithmetic tradition of social research. Secondary data analysis is a relatively under-used technique in Education and in the social sciences more widely, and it is an approach that is not without its critics. Here we consider (...) two main objections to the use of secondary data: that it is full of errors and that because of the socially constructed nature of social data, simply reducing it to a numeric form cannot fully encapsulate its complexity. However, secondary data also offers numerous methodological, theoretical and pedagogical benefits. Indeed by treating secondary data analysis with appropriate scepticism and respect for its limitations, by demanding that tacit assumptions about the unreliability of secondary data are applied equally to other research methods, and crucially by combining secondary data analysis with small-scale in-depth work, this paper argues for a return to prominence of secondary data analysis in its own right as well as becoming a central component of the new political arithmetic tradition of social research. (shrink)

In early analytic philosophy, one of the most central questions concerned the status of arithmetical objects. Frege argued against the popular conception that we arrive at natural numbers with a psychological process of abstraction. Instead, he wanted to show that arithmetical truths can be derived from the truths of logic, thus eliminating all psychological components. Meanwhile, Dedekind and Peano developed axiomatic systems of arithmetic. The differences between the logicist and axiomatic approaches turned out to be philosophical as well as (...) mathematical. In this paper, I will argue that Dedekind’s approach can be seen as a precursor to modern structuralism and as such, it enjoys many advantages over Frege’s logicism. I also show that from a modern perspective, Frege’s criticism of abstraction and psychologism is one-sided and fails against the psychological processes that modern research suggests to be at the heart of numerical cognition. The approach here is twofold. First, through historical analysis, I will try to build a clear image of what Frege’s and Dedekind’s views on arithmetic were. Then, I will consider those views from the perspective of modern philosophy of mathematics, and in particular, the empirical study of arithmetical cognition. I aim to show that there is nothing to suggest that the axiomatic Dedekind approach could not provide a perfectly adequate basis for philosophy of arithmetic. (shrink)

Brouwer and Husserl both aimed to give a philosophical account of mathematics. They met in 1928 when Husserl visited the Netherlands to deliver his Amsterdamer Vorträge. Soon after, Husserl expressed enthusiasm about this meeting in a letter to Heidegger, and he reports that they had long conversations which, for him, had been among the most interesting events in Amsterdam. However, nothing is known about the content of these conversations; and it is not clear whether or not there were any other (...) exchanges between them. The following is an attempt at some remarks on Husserl’s Philosophy of Arithmetic from an intuitionistic, by which I mean a Brouwerian, point of view. I will confine myself specifically to some intuitionistic musings on Husserl’s analysis of the concept of finite number, which he developed in his Habilitationsschrift of 1887, “On the Concept of Number,” and presented again in 1891 in the first four chapters of the Philosophy of Arithmetic. It will turn out that the intuitionistic account of number is very different from Husserl’s. For instance, they strongly disagree about the number 2. On the other hand, the roots of the projects of Husserl and Brouwer have much in common. Since this fact makes their disagreement pressing and lends it much of its significance, I will begin there. (shrink)

§1. Introduction. The purpose of this paper is, in general, to report the state of the art of ordinal analysis and, in particular, the recent success in obtaining an ordinal analysis for the system of-analysis, which is the subsystem of formal second order arithmetic, Z2, with comprehension confined to-formulae. The same techniques can be used to provide ordinal analyses for theories that are reducible to iterated-comprehension, e.g.,-comprehension. The details will be laid out in [28].Ordinal-theoretic proof theory (...) came into existence in 1936, springing forth from Gentzen's head in the course of his consistency proof of arithmetic. Gentzen fostered hopes that with sufficiently large constructive ordinals one could establish the consistency of analysis, i.e., Z2. Considerable progress has been made in proof theory since Gentzen's tragic death on August 4th, 1945, but an ordinal analysis of Z2is still something to be sought. However, for reasons that cannot be explained here,-comprehension appears to be the main stumbling block on the road to understanding full comprehension, giving hope for an ordinal analysis of Z2in the foreseeable future.Roughly speaking,ordinally informativeproof theory attaches ordinals in a recursive representation system to proofs in a given formal system; transformations on proofs to certain canonical forms are then partially mirrored by operations on the associated ordinals. Among other things, ordinal analysis of a formal system serves to characterize its provably recursive ordinals, functions and functionals and can yield both conservation and combinatorial independence results. (shrink)

In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems Tnω in all finite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive functions of low growth. We reduce the use of instances of these principles in Tnω-proofs of a large class of formulas to the use of instances of certain arithmetical principles thereby determining faithfully the (...) arithmetical content of the former. This is achieved using the method of elimination of Skolem functions for monotone formulas which was introduced by the author in a previous paper.As corollaries we obtain new conservation results for fragments of analysis over fragments of arithmetic which strengthen known purely first-order conservation results.We also characterize the provably recursive functions of type 2 of the extensions of Tnω based on these fragments of arithmetical comprehension, choice and uniform boundedness. (shrink)

§1. Introduction. The purpose of this paper is, in general, to report the state of the art of ordinal analysis and, in particular, the recent success in obtaining an ordinal analysis for the system of -analysis, which is the subsystem of formal second order arithmetic, Z2, with comprehension confined to -formulae. The same techniques can be used to provide ordinal analyses for theories that are reducible to iterated -comprehension, e.g., -comprehension. The details will be laid out (...) in [28].Ordinal-theoretic proof theory came into existence in 1936, springing forth from Gentzen's head in the course of his consistency proof of arithmetic. Gentzen fostered hopes that with sufficiently large constructive ordinals one could establish the consistency of analysis, i.e., Z2. Considerable progress has been made in proof theory since Gentzen's tragic death on August 4th, 1945, but an ordinal analysis of Z2 is still something to be sought. However, for reasons that cannot be explained here, -comprehension appears to be the main stumbling block on the road to understanding full comprehension, giving hope for an ordinal analysis of Z2 in the foreseeable future.Roughly speaking, ordinally informative proof theory attaches ordinals in a recursive representation system to proofs in a given formal system; transformations on proofs to certain canonical forms are then partially mirrored by operations on the associated ordinals. Among other things, ordinal analysis of a formal system serves to characterize its provably recursive ordinals, functions and functionals and can yield both conservation and combinatorial independence results. (shrink)

The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a (...) subspace of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)