We study extensions of Presburger arithmetic with a unary predicate R and we show that under certain conditions on R, R is sparse and the theory of $\langle\mathbb{N}, +, R\rangle$ is decidable. We axiomatize this theory and we show that in a reasonable language, it admits quantifier elimination. We obtain similar results for the structure $\langle\mathbb{Q},+, R\rangle$.

Gödel’s Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We will show that axiomatizations for a computer’s floating point arithmetic can recognize their cut-free consistency in a stronger respect than is feasible under integer arithmetics. This paper will include both new generalizations of the Second Incompleteness Theorem and techniques for evading it.

The aim of this article is to indicate that the ideas of Leonardo Torres y Que­vedo presented in his short Essays on Automatics constitute essential link between early Babbage’s concepts of analytical engine and modern computer science. These ideas include definition of automatics, classification of automata, theoretical basis for robotics, electromechanical engineering, modern concept of chatbot, the importance of algorithm and last but not least floating point arithmetic.

The aim of this article is to indicate that the ideas of Leonardo Torres y Que­vedo presented in his short Essays on Automatics constitute essential link between early Babbage’s concepts of analytical engine and modern computer science. These ideas include definition of automatics, classification of automata, theoretical basis for robotics, electromechanical engineering, modern concept of chatbot, the importance of algorithm and last but not least floating point arithmetic.

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...) computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

We examine two very different approaches to formalising real computation, commonly referred to as “Computable Analysis” and “the BSS approach”. The main models of computation underlying these approaches—bit computation and BSS, respectively—have also been put forward as appropriate foundations for scientific computing. The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space. Since typically the problems dealt with in physical sciences, applied mathematics, economics, and engineering are also defined in uncountable domains, it (...) is fitting that we choose between these two approaches a foundational framework for scientific computing. However, the models are incompatible as to their results. What is more, the BSS model is highly idealised and unrealistic; yet, it is the de facto implicit model in various areas of computational mathematics, with virtually no problems for the everyday practice. This paper serves three purposes. First, we attempt to delineate what the goal of developing foundations for scientific computing exactly is. We distinguish between two very different interpretations of that goal, and on the separate basis of each one, we put forward answers about the appropriateness of each framework. Second, we provide an account of the fruitfulness and wide use of BSS, despite its unrealistic assumptions. Third, according to one of our proposed interpretations of the scope of foundations, the target domain of both models is a certain mathematical structure. In a clear sense, then, we are using idealised models to study a purely mathematical structure. The third purpose is to point out and explain this intriguing phenomenon and attempt to make connections with the typical case of idealised models of empirical domains. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...) computation and to offer foundations for scientific computing. The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Jäger, G., Fixed points in Peano arithmetic with ordinals, Annals of Pure and Applied Logic 60 119-132. This paper deals with some proof-theoretic aspects of fixed point theories over Peano arithmetic with ordinals. It studies three such theories which differ in the principles which are available for induction on the natural numbers and ordinals. The main result states that there is a natural theory in this framework which is a conservative extension of Peano arithmeti.

We study the formalization within sybsystems of second-order arithmetic of theorems concerning periodic points in dynamical systems on the real line. We show that Sharkovsky's theorem is provable in WKL0. We show that, with an additional assumption, Sharkovsky's theorem is provable in RCA0. We show that the existence for all n of n-fold iterates of continuous mappings of the closed unit interval into itself is equivalent to the disjunction of Σ02 induction and weak König's lemma.

The purpose of this article is to present a new theory for fixed points over arithmetic which allows the building up of fixed points in a very nested and entangled way. But in spite of its great expressive power we can show that the proof-theoretic strength of our theory—which is intensional in a meaning to be described below—is characterized by the Feferman–Schütte ordinal Γ0. Our approach is similar to the building up of fixed points over state spaces in the (...) propositional modal μ-calculus. (shrink)

Matthew Kramer has recently proposed a distinction between norms that are free-floating and those that are not. The distinction, he argued, enables us to distinguish between norms that can be incorporated into the law and those that cannot. In this essay I argue that his distinction is based on several theoretical errors, and that even if it were successful, it is unclear why his distinction is relevant for the question of the boundaries between law and morality. I also provide (...) many examples from actual legal systems of legal norms that do not correspond to Kramer’s distinction. I conclude the essay by suggesting that Kramer’s argument exemplifies a prevalent problem in contemporary legal philosophy, in which much work is often based on simplistic models of law and uses them to develop ‘conceptual’ arguments for what closer attention to the facts shows are empirical questions. As a result many current jurisprudential debates are not helpful for understanding legal phenomena. Recognizing this point is important for reorienting legal philosophy towards other questions which would be more helpful for illuminating its subject-matter. (shrink)

In this paper we will show that for every cutIof any countable nonstandard model$\mathcal {M}$of$\mathrm {I}\Sigma _{1}$, eachI-small$\Sigma _{1}$-elementary submodel of$\mathcal {M}$is of the form of the set of fixed points of some proper initial self-embedding of$\mathcal {M}$iffIis a strong cut of$\mathcal {M}$. Especially, this feature will provide us with some equivalent conditions with the strongness of the standard cut in a given countable model$\mathcal {M}$of$ \mathrm {I}\Sigma _{1} $. In addition, we will find some criteria for extendability of initial (...) self-embeddings of countable nonstandard models of$ \mathrm {I}\Sigma _{1} $to larger models. (shrink)

The paper explores the idea that some singular judgements about the natural numbers are immune to error through misidentification by pursuing a comparison between arithmetic judgements and first-person judgements. By doing so, the first part of the paper offers a conciliatory resolution of the Coliva-Pryor dispute about so-called “de re” and “which-object” misidentification. The second part of the paper draws some lessons about what it takes to explain immunity to error through misidentification. The lessons are: First, the so-called Simple (...) Account of which-object immunity to error through misidentification to the effect that a judgement is immune to this kind of error just in case its grounds do not feature any identification component fails. Secondly, wh-immunity can be explained by a Reference-Fixing Account to the effect that a judgement is immune to this kind of error just in case its grounds are constituted by the facts whereby the reference of the concept of the object which the judgement concerns is fixed. Thirdly, a suitable revision of the Simple Account explains the de re immunity of those arithmetic judgements which are not wh-immune. These three lessons point towards the general conclusion that there is no unifying explanation of de re and wh-immunity. (shrink)

The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures.

This article provides a detailed comparison between two systems of collapsing functions. These functions play a crucial role in proof theory, in the analysis of patterns of resemblance, and the analysis of maximal order types of well partial orders. The exact correspondence given here serves as a starting point for far reaching extensions of current results on patterns and well partial orders. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

This paper starts by investigating Ackermann's interpretation of finite set theory in the natural numbers. We give a formal version of this interpretation from Peano arithmetic (PA) to Zermelo-Fraenkel set theory with the infinity axiom negated (ZF−inf) and provide an inverse interpretation going the other way. In particular, we emphasize the precise axiomatization of our set theory that is required and point out the necessity of the axiom of transitive containment or (equivalently) the axiom scheme of ∈-induction. This (...) clarifies the nature of the equivalence of PA and ZF−inf and corrects some errors in the literature. We also survey the restrictions of the Ackermann interpretation and its inverse to subsystems of PA and ZF−inf, where full induction, replacement, or separation is not assumed. The paper concludes with a discussion on the problems one faces when the totality of exponentiation fails, or when the existence of unordered pairs or power sets is not guaranteed. (shrink)

In this paper, representational structures of arithmetical thinking, encoded in human minds, are described. On the basis of empirical research, it is possible to distinguish four types of mental number lines: the shortest mental number line, summation mental number lines, point-place mental number lines and mental lines of exact numbers. These structures may be treated as generative mechanisms of forming arithmetical representations underlying our numerical acts of reference towards cardinalities, ordinals and magnitudes. In the paper, the theoretical framework for (...) a formal model of mental arithmetical representations is constructed. Many competitive conceptions of the mental system responsible for our arithmetical thinking may be unified within the presented framework. The paradigm underlying our research may be interpreted philosophically as a neo-Kantian approach to modeling the mind’s representational structures. (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)

This is the only work to provide a histori­cal account of Kant’s theory of arith­metic, examining in detail the theories of both his predecessors and his successors. Until his death, Martin was the editor of _Kant-Studien _from 1954_, _of the gen­eral Kant index from 1964, of the Leibniz index from 1968, and coeditor of _Leib­nizstudien _from 1969. This background is used to its fullest as he strives to make clear the historical milieu in which Kant’s mathematical contributions de­veloped. He uses (...) Leibniz, Wolff, and oth­ers whose work was accomplished before Kant was born as well as Lambert, Men­delssohn, and others roughly contempo­rary with Kant; and when a point requires it, he refers to Gauss, Grassman, Frege, Russell, and Hilbert. In her translation Wubnig has ap­proached the original author with an abiding respect. She makes the transla­tion flow in English while preserving as far as possible the flavor of the original. She has added many bibliographical and biographical details to ease the following up of Martin’s allusions and suggestions. (shrink)

Biró, B. and I. Sain, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, Annals of Pure and Applied Logic 63 201-225. We show that one can prove the partial correctness of more programs using Peano's axioms for the time frames of three-sorted time models than using only Presburger's axioms, that is it is useful to allow multiplication of time points at program verification and in dynamic and temporal logics. We organized the (...) paper as follows: 1. Preliminaries, 2. The main result, 3. Peano arithmetic with bounded multiplication, 4. Connections with temporal logics and dynamic logics, Acknowledgements, References. (shrink)

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories: iterate adding consistency of some weak base theory until you “hit” the target theory. Turing progressions based on n-consistency give rise to a \ proof-theoretic ordinal \ also denoted \. As such, to each theory U we can assign the sequence of corresponding \ ordinals \. We call this sequence a Turing-Taylor expansion or spectrum of a theory. In this paper, we relate Turing-Taylor expansions of sub-theories (...) of Peano Arithmetic to Ignatiev’s universal model for the closed fragment of the polymodal provability logic \. In particular, we observe that each point in the Ignatiev model can be seen as Turing-Taylor expansions of formal mathematical theories. Moreover, each sub-theory of Peano Arithmetic that allows for a Turing-Taylor expansion will define a unique point in Ignatiev’s model. (shrink)

The paper aims to put certain basic mathematical elements and operations into an empirical perspective, evaluate the empirical status of various analytic operations widely used within psychology and suggest alternatives to procedures criticized as inadequate. Experimentation shows the "manyness" of items to be a perceptual quality for both young children and animals and that natural operations are performed by naive children analogous to those performed by persons tutored in arithmetic. Number, counting, arithmetic operations therefore can make distinctions that (...) are not inevitably arbitrary, and conceptual operations can obviously have a status as natural events with psychology. If the elements and conceptual operations involved in mathematical systems were not inherent in physiological process, various primitive discriminations could not be possible. Also, since some calculi have a natural status in a given empirical circumstance, the axioms of others can not be satisfied. Therefore the psychologist when acting as an empirical scientist seeks a calculus having a structure whose elements are isomorphic with natural units of stimulus and response and whose operations are isomorphic with whatever natural processes are involved. Measurement poses a special problem for the empirical scientist. It concerns but a single class of natural qualities and this only in a limited way. The concept of quantity has a natural counterpart but quantity and measurement are not wholly analogous. Measurement is defined, as H. S. Leonard suggests, as a theoretical activity. Measurement theory has a formal structure but empirical end. Measurement hypothesizes about the position of a particular quality within a definite range of qualities. It therefore is beholden to definite empirical restrictions. Some hypotheses-making systems use terms and relations per se as the context and starting point for dealing with discriminable events. Such procedures are 'transcendent." In empirical science, questions are part of problem-solving activity and their reference is naturally restricted. In providing description and explanation, psychological researchers frequently use calculi in a transcendent way. This results in theories that are only quasi-empirical and "half" true. The roles measurement plays in psychology are discussed. Of particular concern are those cases in which the results of measuring or a theory of measurement are used to define the "real" units, or the "real" relations involved in problematic psychological events, and thence to describe and explain behaviors of interest. Metaphysical or ontological usages of measurement sometimes occur. The implication of these arguments with regard to a view of empirical science is discussed. (shrink)

Published in honor of Sergio Galvan, this collection concentrates on the application of logical and mathematical methods for the study of central issues in formal philosophy. The volume is subdivided into four sections, dedicated to logic and philosophy of logic, philosophy of mathematics, philosophy of science, metaphysics and philosophy of religion. The contributions adress, from a logical point of view, some of the main topics in these areas. The first two sections include formal treatments of: truth and paradoxes; definitions (...) by abstraction; the status of abstract objects, such as mathematical objects and universal concepts; and the structure of explicit knowledge. The last two sections include papers on classical problems in philosophy of science, such as the status of subjective probability, the notion of verisimilitude, the notion of approximation, and the theory of mind and mental causation, and specific issues in metaphysics and philosophy of religion, such as the ontology of species, actions, and intelligible worlds, and the logic of religious belonging. (shrink)

This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6]. In those works, Peano’s axioms for arithmetic were formulated with a logical base of the relevant logic R, and it was proved finitistically that the resulting arithmetic, called R♯, was absolutely consistent. It was pointed out that such a result escapes incau- tious formulations of Goedel’s second incompleteness theorem, and provides a basis for a revived Hilbert programme. The absolute consistency result used (...) as a model arithmetic modulo two. Modulo arithmetics are not or- dinarily thought of as an extension of Peano arithmetic, since some of the propositions of the latter, such as that zero is the successor of no number, fail in the former. Consequently a logical base which, unlike classical logic, tolerates contradictory theories was used for the model. The logical base for the model was the three-valued logic RM3, which has the advantage that while it is an extension of R, it is finite valued and so easier to handle. The resulting model-theoretic structure is interesting in its own right in that the set of sentences true therein consti- tutes a negation inconsistent but absolutely consistent arithmetic which is an extension of R♯. In fact, in the light of the result of [6], it is an extension of Peano arithmetic with a base of a classical logic, P♯. A generalisation of the structure is to modulo arithmetics with the same logical base RM3, but with varying moduli. We first study the properties of these arithmetics in this paper. The study is then generalised by vary- ing the logical base, to give the arithmetics RMni, of logical base RMn and modulus i. Not all of these exist, however, as arithmetical properties and logical properties interact, as we will show. The arithmetics RMni give rise, on intersection, to an inconsistent arithmetic RMω which is not of modulo i for any i. We also study its properties, and, among other results, we show by finitistic means that the more natural relevant arithmetics R♯ and R♯♯ are incomplete. In the rest of the paper we apply these techniques to several topics, particularly relevant quantum arithmetic in which we are able to show that the law of distribution remains unprovable. Aside from its intrinsic interest, we regard the present exercise as a demonstration that inconsistent theories and models are of mathematical worth and interest. (shrink)

This paper develops a general language of event configurations to discuss and compare various modes of proposition formation. It is shown that any finite orthogonality space can be numerically encoded. This encoding is applied to show that the quasimanual of all orthogonal subsets of any finite point-determining orthogonality space may be decomposed into a union of manuals and that the logic of these quasimanuals may be regarded as a composite of interlocking associative orthoalgebras.

Published in honor of Sergio Galvan, this collection concentrates on the application of logical and mathematical methods for the study of central issues in formal philosophy. The volume is subdivided into four sections, dedicated to logic and philosophy of logic, philosophy of mathematics, philosophy of science, metaphysics and philosophy of religion. The contributions adress, from a logical point of view, some of the main topics in these areas. The first two sections include formal treatments of: truth and paradoxes; definitions (...) by abstraction; the status of abstract objects, such as mathematical objects and universal concepts; and the structure of explicit knowledge. The last two sections include papers on classical problems in philosophy of science, such as the status of subjective probability, the notion of verisimilitude, the notion of approximation, and the theory of mind and mental causation, and specific issues in metaphysics and philosophy of religion, such as the ontology of species, actions, and intelligible worlds, and the logic of religious belonging. (shrink)

The subject of the first section is Carnapian modal logic. One of the things I will do there is to prove that certain description principles, viz. the ''self-predication principles'', i.e. the principles according to which a descriptive term satisfies its own descriptive condition, are theorems and that others are not. The second section will be devoted to Carnapian modal arithmetic. I will prove that, if the arithmetical theory contains the standard weak principle of induction, modal truth collapses to truth. (...) Then I will propose a different formulation of Carnapian modal arithmetic and establish that it is free of collapse. Noteworthy is that one can retain the standard strong principle of induction. I will occupy myself in the third section with Carnapian epistemic logic and arithmetic. Here too it is claimed that the standard weak principle of induction is invalid and that the alternative principle is valid. In the fourth and last section I will get back to the self-predication principles and I will point to some of the consequences if one adds them to Carnapian Epistemic arithmetic. The interaction of self-predication principles and the strong principle of induction results in a collapse of de re knowability. (shrink)

We develop the method of iterated ultrapower representation to provide a unified and perspicuous approach for building automorphisms of countable recursively saturated models of Peano arithmetic . In particular, we use this method to prove Theorem A below, which confirms a long-standing conjecture of James Schmerl.Theorem AIf is a countable recursively saturated model of in which is a strong cut, then for any there is an automorphism j of such that the fixed point set of j is isomorphic (...) to .We also fine-tune a number of classical results. One of our typical results in this direction is Theorem B below, which generalizes a theorem of Kaye–Kossak–Kotlarski .Theorem BSuppose is a countable recursively saturated model of in which is a strong cut. There is a group embedding from into such that for each that is fixed point free, moves every undefinable element of. (shrink)

The philosophy of arithmetic of Wittgenstein's Tractatus is outlined and the central role played in it by the general notion of operation is pointed out. Following which, the language, the axioms and the rules of a formal theory of operations, extracted from the Tractatus, are presented and a theorem of interpretability of the equational fragment of Peano's Arithmetic into such a formal theory is proven.

I had the pleasure of renewing my acquaintance with Per Lindström at the meeting of the Seventh Scandinavian Logic Symposium, held in Uppsala in August 1996. There at lunch one day, Per said he had long been curious about the development of some of the ideas in my paper [1960] on the arithmetization of metamathematics. In particular, I had used the construction of a non-standard definition !* of the set of axioms of P (Peano Arithmetic) to show that P (...) + {¬ Con!} is interpretable in P, where ! is a standard definition of the axioms of P and Con! expresses the consistency of P via that presentation. Per pointed out that there is a simple “two-line” proof of this interpretability result which does not require the use of such formulas as !*, and he wondered whether I had been aware of that. In fact, his proof had never occurred to me, and if it had at the time, it is possible I would never have been led to the use of non-natural definitions. Per regarded this as a happy accident, since subsequent work by him and others on interpretability made essential use of such definitions. In our conversation, I enlarged a bit on the background to my work on arithmetization, and when I was invited to contribute to this special issue of Theoria dedicated to Lindström, it seemed a natural choice to use the occasion to fill out the story. One caveat, though: the following is drawn largely from memory, not always reliable, supplemented by consultation of the 1960 paper and the 1957 dissertation from which it was drawn. (shrink)

In his groundbreaking Grundlagen, Frege (1884) pointed out that number words like ‘four’ occur in ordinary language in two quite different ways and that this gives rise to a philosophical puzzle. On the one hand ‘four’ occurs as an adjective, which is to say that it occurs grammatically in sentences in a position that is commonly occupied by adjectives. Frege’s example was (1) Jupiter has four moons, where the occurrence of ‘four’ seems to be just like that of ‘green’ in (...) (2) Jupiter has green moons. On the other hand, ‘four’ occurs as a singular term, which is to say that it occurs in a position that is commonly occupied by paradigmatic cases of singular terms, like proper names: (3) The number of moons of Jupiter is four. Here ‘four’ seems to be just like ‘Wagner’ in (4) The composer of Tannhäuser is Wagner, and both of these statements seem to be identity statements, ones with which we claim that what two singular terms stand for is identical. But that number words can occur both as singular terms and as adjectives is puzzling. Usually adjectives cannot occur in a position occupied by a singular term, and the other way round, without resulting in ungrammaticality and nonsense. To give just one example, it would be ungrammatical to replace ‘four’ with ‘the number of moons of Jupiter’ in (1): (5) *Jupiter has the number of moons of Jupiter moons. This ungrammaticality results even though ‘four’ and ‘the number of moons of Jupiter’ are both apparently singular terms standing for the same object in (3). So, how can it be that number words can occur both as singular terms and as adjectives, while other adjectives cannot occur as singular terms, and other singular terms cannot occur as adjectives? (shrink)

Interactivity has been linked to better performance in problem solving, due in part to a more efficient allocation of attentional resources, a better distribution of cognitive load, but perhaps more important by enabling the reasoner to shape and reshape the physical problem presentation to promote the development of the problem solution. Interactivity in solving quotidian arithmetic problems involves gestures, pointing, and the recruitment of artefacts to facilitate computation and augment efficiency. In the experiment reported here, different types of interactivity (...) were examined with a series of mental arithmetic problems. Using a repeated-measures design, participants solved series of five 11-digit sums in four conditions that varied in the type of interactivity: no interactivity, pointing, pen and paper, and tokens. Performance in the four conditions was measured in terms of accuracy, calculation error, and efficiency. These quantitative analyses were supplemented by a detailed qualitative examination of a participant’s actions in the different conditions. The integration of artefacts, such as tokens or a pen, offered reasoners the opportunity to reconfigure the physical presentation of the problem, enacting different arithmetic strategies: the affordance landscape shifts as the problem trajectory is enacted through interactivity, and this generally produced better “mental” arithmetic performance. Participants also felt more positive about and better engaged with the task when they could reconfigure the problem presentation through interactivity. These findings underscore the importance of engineering task environments in the laboratory that offer a window on how problem solving unfolds through a coalition of mental and physical resources. (shrink)

The 1-consistency of arithmetic is shown to be equivalent to the existence of fixed points of a certain type of update procedure, which is implicit in the epsilon-substitution method.

This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6] (see also Routley [10] and Asenjo [11]). In those works, Peano’s axioms for arithmetic were formulated with a logical base of the relevant logic R, and it was proved finitistically that the resulting arithmetic, called R♯, was absolutely consistent. It was pointed out that such a result escapes incau- tious formulations of Goedel’s second incompleteness theorem, and provides a basis for a revived (...) Hilbert programme. The absolute consistency result used as a model arithmetic modulo two. Modulo arithmetics are not or- dinarily thought of as an extension of Peano arithmetic, since some of the propositions of the latter, such as that zero is the successor of no number, fail in the former. Consequently a logical base which, unlike classical logic, tolerates contradictory theories was used for the model. The logical base for the model was the three-valued logic RM3 (see e.g. [1] or [8]), which has the advantage that while it is an extension of R, it is finite valued and so easier to handle. The resulting model-theoretic structure (called in this paper RM32) is interesting in its own right in that the set of sentences true therein consti- tutes a negation inconsistent but absolutely consistent arithmetic which is an extension of R♯. In fact, in the light of the result of [6], it is an extension of Peano arithmetic with a base of a classical logic, P♯. A generalisation of the structure is to modulo arithmetics with the same logical base RM3, but with varying moduli (called RM3i here). We first study the properties of these arithmetics in this paper. The study is then generalised by vary- ing the logical base, to give the arithmetics RMni, of logical base RMn and modulus i. Not all of these exist, however, as arithmetical properties and logical properties interact, as we will show. The arithmetics RMni give rise, on intersection, to an inconsistent arithmetic RMω which is not of modulo i for any i. We also study its properties, and, among other results, we show by finitistic means that the more natural relevant arithmetics R♯ and R♯♯ are incomplete (whether or not consistent and recursively enumerable). In the rest of the paper we apply these techniques to several topics, particularly relevant quantum arithmetic in which we are able to show (unlike classical quantum arithmetic) that the law of distribution remains unprovable. Aside from its intrinsic interest, we regard the present exercise as a demonstration that inconsistent theories and models are of mathematical worth and interest. (shrink)

Russell held that the theory of natural numbers could be derived from three primitive concepts: number, successor and zero. This leaves out multiplication and addition. Russell introduces these concepts by recursive definition. It is argued that this does not render addition or multiplication any less primitive than the other three. To this it might be replied that any recursive definition can be transformed into a complete or explicit definition with the help of a little set theory. But that is a (...) point about set theory, not number theory. We have learned more about the distinction between logic and set theory than was known in Russell's day, especially as this affects logicist aspirations. (shrink)

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like 'All the theorems are true', 'Everything Peter said is true', etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first-order logic, full second-order logic, and existential second-order (?11-) logic. (shrink)

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like ‘All the theorems are true’, ‘Everything Peter said is true’, etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first‐order logic, full second‐order logic, and existential second‐order logic. (shrink)

In this paper it is shown that the intuitionistic .xed point theory equation image for α times iterated fixed points of strictly positive operator forms is conservative for negative arithmetic and equation image sentences over the theory equation image for α times iterated arithmetic comprehension without set parameters.This generalizes results previously due to Buchholz [5] and Arai [2].

We introduce constructive and classical systems for nonstandard arithmetic and show how variants of the functional interpretations due to Gödel and Shoenfield can be used to rewrite proofs performed in these systems into standard ones. These functional interpretations show in particular that our nonstandard systems are conservative extensions of E-HAω and E-PAω, strengthening earlier results by Moerdijk and Palmgren, and Avigad and Helzner. We will also indicate how our rewriting algorithm can be used for term extraction purposes. To conclude (...) the paper, we will point out some open problems and directions for future research, including some initial results on saturation principles. (shrink)

The paper is divided into three parts. The first part identifies one of the main problems with many current accounts of the notion of explanation: The unreasonable demand, proposed by Michael Scriven and subsequently adopted by many philosophers, that we must square our account of scientific explanation to our intuitions about explanations in everyday contexts. It is first pointed out that the failure to provide a satisfactory account is not endemic to the notion of explanation, i.e. it is widespread amongst (...) notions. Many of the notions considered in philosophical contexts originate and have a function in broader everyday contexts. Indeed, in evaluating accounts of these notions we rely on intuitions that originate in these broader contexts. Yet, we rarely seem to question the appropriateness of these intuitions in more restricted, in this case scientific, contexts. I argue against this complacency, pointing out that our intuitions can often be inconsistent. (shrink)

This volume contains an English translation of Edmund Husserl’s first major work, the Philosophie der Arithmetik, (Husserl 1891). As a translation of Husserliana XII (Husserl 1970), it also includes the first chapter of Husserl’s Habilitationsschrift (Über den Begriff der Zahl) (Husserl 1887) and various supplementary texts written between 1887 and 1901. This translation is the crowning achievement of Dallas Willard’s monumental research into Husserl’s early philosophy (Husserl 1984) and should be seen as a companion to volume V of the Husserliana: (...) Collected Works series (Husserl 1994b), which already contained selected translations from Hua XII. As Willard re- marks on the inner cover of the volume, it is “a window on a period of rich and illuminating philosophical activity”, to which I wholeheartedly agree. Willard’s two volumes of translations open this window on the beginnings of Husserl’s philosophy for the English-speaking world. This earliest period of Husserl’s philosophy has often been unjustly ignored and Willard provides the English reader with an excellent starting point. Husserl’s first steps into phenomenology and the philosophy of logic and mathematics contain many promising seeds that will flower later on, in the Logische Untersuchungen and beyond. (shrink)

Newtonian physics is based on Newtonian calculus applied to Newtonian dynamics. New paradigms such as ‘modified Newtonian dynamics’ change the dynamics, but do not alter the calculus. However, calculus is dependent on arithmetic, that is the ways we add and multiply numbers. For example, in special relativity we add and subtract velocities by means of addition β1⊕β2=tanh+tanh-1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _1\oplus \beta _2=\tanh \big +\tanh ^{-1}\big )$$\end{document}, although multiplication β1⊙β2=tanh·tanh-1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...) \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _1\odot \beta _2=\tanh \big \cdot \tanh ^{-1}\big )$$\end{document}, and division β1⊘β2=tanh/tanh-1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _1\oslash \beta _2=\tanh \big /\tanh ^{-1}\big )$$\end{document} do not seem to appear in the literature. The map fX=tanh-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_{\mathbb{X}}=\tanh ^{-1}$$\end{document} defines an isomorphism of the arithmetic in X=\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}=$$\end{document} with the standard one in R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}}$$\end{document}. The new arithmetic is projective and non-Diophantine in the sense of Burgin, 1977), while ultrarelativistic velocities are super-large in the sense of Kolmogorov, 1961). Velocity of light plays a role of non-Diophantine infinity. The new arithmetic allows us to define the corresponding derivative and integral, and thus a new calculus which is non-Newtonian in the sense of Grossman and Katz. Treating the above example as a paradigm, we ask what can be said about the set X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} of ‘real numbers’, and the isomorphism fX:X→R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_{{\mathbb{X}}}:{\mathbb{X}}\rightarrow {\mathbb{R}}$$\end{document}, if we assume the standard form of Newtonian mechanics and general relativity but demand agreement with astrophysical observations. It turns out that the observable accelerated expansion of the Universe can be reconstructed with zero cosmological constant if fX≈0.8sinh/\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_{\mathbb{X}}\approx 0.8\sinh /$$\end{document}. The resulting non-Newtonian model is exactly equivalent to the standard Newtonian one with ΩΛ=0.7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega _\Lambda =0.7$$\end{document}, ΩM=0.3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega _M=0.3$$\end{document}. Asymptotically flat rotation curves are obtained if ‘zero’, the neutral element 0X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$0_{{\mathbb{X}}}$$\end{document} of addition, is nonzero from the point of view of the standard arithmetic of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{R}}$$\end{document}. This implies fX-1=0X>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f^{-1}_{{\mathbb{X}}}=0_{{\mathbb{X}}}>0$$\end{document}. The opposition Diophantine versus non-Diophantine, or Newtonian versus non-Newtonian, is an arithmetic analogue of Euclidean versus non-Euclidean in geometry. We do not yet know if the proposed generalization ultimately removes any need of dark matter, but it will certainly change estimates of its parameters. Physics of the dark universe seems to be both geometry and arithmetic. (shrink)

Global properties of canonical derivability predicates in Peano Arithmetic) are studied here by means of a suitable propositional modal logic GL. A whole book [1] has appeared on GL and we refer to it for more information and a bibliography on GL. Here we propose a sequent calculus for GL and, by exhibiting a good proof procedure, prove that such calculus admits the elimination of cuts. Most of standard results on GL are then easy consequences: completeness, decidability, finite model (...) property, interpolation and the fixed point theorem. (shrink)

The style of arithmetic in the treatises the Neo-Pythagorean authors is strikingly different from that of the "Elements". Namely, it is characterised by the absence of proof in the Euclidean sense and a specific genetic approach to the construction of arithmetic that we are going to describe in our paper. Lack of mathematical sophistication has led certain historians to consider this type of mathematics as a feature of decadence of mathematics in this period [Tannery 1887; Heath 1921]. The (...) alleged absence of originality in these works has also given grounds to believe that “the arithmetic presented in these works derives substantially from an ancient, primitive stage of Pythagorean arithmetic” and to use them as “an index of the character of arithmetic science in the 5th century” [Knorr 1975]. In this paper, we take Nicomachus’ Introduction to Arithmetic for point of departure, because it is the richest and most well organised treatise representing this tradition. However, we also take into account the works of other Neo-Pythagorean authors. We are going to show that the Neo-Pythagorean arithmetic might have been developed in a natural, self-contained manner as a simple theory of counting over a domain of concrete initial objects, designated by fixed signs. This approach can be comfortably realised without appealing to assumptions of axiomatic character, but relying upon some ‘genetic’ constructions intented to be carried out by means of the designated entities. (shrink)

Arithmetical comprehension is proved to be equivalent to the enumerability of singular points of any measure on the Cantor space. It is provable in ACA0 that any perfect closed subset of [0, 1] is the support of some continuous positive linear functional on C[0, 1].

Any two models of arithmetic can be jointly embedded in a third with any prescribed isomorphic submodels as intersection and any prescribed relative ordering of the skies above the intersection. Corollaries include some known and some new theorems about ultrafilters on the natural numbers, for example that every ultrafilter with the "4 to 3" weak Ramsey partition property is a P-point. We also give examples showing that ultrafilters with the "5 to 4" partition property need not be P-points (...) and that the main theorem cannot be improved to allow a prescribed ordering of lower skies. (shrink)