Recent historical studies have investigated the first proponents of methodological structuralism in late nineteenth-century mathematics. In this paper, I shall attempt to answer the question of whether Peano can be counted amongst the early structuralists. I shall focus on Peano’s understanding of the primitive notions and axioms of geometry and arithmetic. First, I shall argue that the undefinability of the primitive notions of geometry and arithmetic led Peano to the study of the relational features of the systems of (...) objects that compose these theories. Second, I shall claim that, in the context of independence arguments, Peano developed a schematic understanding of the axioms which, despite diverging in some respects from Dedekind’s construction of arithmetic, should be considered structuralist. From this stance I shall argue that this schematic understanding of the axioms anticipates the basic components of a formal language. (shrink)

Peano's axiomatizations of geometry are abstract and non-intuitive in character, whereas Peano stresses his appeal to concrete spatial intuition in the choice of the axioms. This poses the problem of understanding the interrelationship between abstraction and intuition in his geometrical works. In this article I argue that axiomatization is, for Peano, a methodology to restructure geometry and isolate its organizing principles. The restructuring produces a more abstract presentation of geometry, which does not contradict its intuitive content but only puts (...) it into a particular form. (shrink)

We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak subsystems of second order arithmetic. Specifically, we consider the Cauchy/Peano existence theorem for solutions of ordinary differential equations, in the context of the formal system RCA 0 whose principal axioms are ▵ 0 1 comprehension and Σ 0 1 induction. Our main result is that, over RCA 0 , the Cauchy/Peano Theorem is provably equivalent to weak Konig's lemma, i.e. the statement that every infinite {0, (...) 1}-tree has a path. We also show that, over RCA 0 , the Ascoli lemma is provably equivalent to arithmetical comprehension, as is Osgood's theorem on the existence of maximum solutions. At the end of the paper we digress to relate our results to degrees of unsolvability and to computable analysis. (shrink)

Peano’s axioms for arithmetic, published in 1889, are ubiquitously cited in writings on modern axiomatics, and his Formulario is often quoted as the precursor of Russell’s Principia Mathematica. Yet, a comprehensive historical and philosophical evaluation of the contributions of the Peano School to mathematics, logic, and the foundation of mathematics remains to be made. In line with increased interest in the philosophy of mathematics for the investigation of mathematical practices, this them...

Peano’s axioms for arithmetic, published in 1889, are ubiquitously cited in writings on modern axiomatics, and his Formulario is often quoted as the precursor of Russell’s Principia Mathematica. Yet, a comprehensive historical and philosophical evaluation of the contributions of the Peano School to mathematics, logic, and the foundation of mathematics remains to be made. In line with increased interest in the philosophy of mathematics for the investigation of mathematical practices, this them...

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)

David Lewis presented Convention as an alternative to the conventionalism characteristic of early-twentieth-century analytic philosophy. Rudolf Carnap is well known for suggesting the arbitrariness of any particular linguistic convention for engaging in scientific inquiry. Analytic truths are self-consistent, and are not checked against empirical facts to ascertain their veracity. In keeping with the logical positivists before him, Lewis concludes that linguistic communication is conventional. However, despite his firm allegiance to conventions underlying not just languages but also social customs, he pioneered (...) the view that convening need not require any active agreement to participate. Lewis proposed that conventions arise from “an exchange of manifestations of a propensity to conform to a regularity” (87–8). In reasserting the conventional quality of languages and other practices resting on mutual expectations, Lewis comfortably works within the analytic tradition. Yet he also deviates from his predecessors because his conventionalist approach is comprehensively grounded in instrumentalism. Lewis adopts an extension of David Hume's desire-belief psychology articulated in rational choice theory. He develops his philosophy of convention relying on the highly formal mid-twentieth-century expected utility and game theories. This attempt to account for language and social customs wholly in terms of instrumental rationality has the implication of reducing normativity to preference satisfaction. Lewis’ approach continues in the trend of undermining normative political philosophy because institutions and practices arise spontaneously, without the deliberate involvement of agents. Perhaps Lewis’ Convention is best seen as a resurgent form of analytic philosophy, characterized by “a style of argument, hostility to [ambitious] metaphysics, focus on language, and the dominance of logic and formalization” that solves the dilemma of “combining the analytic inheritance…with normative concerns” by reducing normativity to individuals’ preference fulfillment consistent with the axioms of rational choice. (shrink)

In 1929 Carnap gave a paper in Prague on Investigations in General Axiomatics; a briefsummary was published soon after. Its subject lookssomething like early model theory, and the mainresult, called the Gabelbarkeitssatz, appears toclaim that a consistent set of axioms is complete justif it is categorical. This of course casts doubt onthe entire project. Though there is no furthermention of this theorem in Carnap''s publishedwritings, his Nachlass includes a largetypescript on the subject, Investigations inGeneral Axiomatics. We examine this work (...) here,showing that it provides important insights intoCarnap''s development during this critical period, thetransition from Aufbau to Syntax,especially regarding the nature and motivation ofCarnap''s logicism. Moreover, we show how theAxiomatics influenced Carnap''s student Gödel inreaching the fundamental logical results that soonafterwards undermined Carnap''s project. (shrink)

We study the theories I∇n, L∇n and overspill principles for ∇n formulas. We show that IEn ⇒ L∇n ⇒ I∇n, but we do not know if I∇n L∇n. We introduce a new scheme, the growth scheme Crγ, and we prove that L∇n ⇒ Cr∇n⇒ I∇n. Also, we analyse the utility of bounded collection axioms for the study of the above theories.

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

George Boolos was one of the most prominent and influential logician-philosophers of recent times. This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; on Frege, Dedekind, Cantor, and Russell; and on miscellaneous topics in logic and proof theory, including three papers on various aspects of the Gödel theorems. Boolos is universally recognized as the leader in the renewed interest in studies of Frege's work on logic and (...) the philosophy of mathematics. John Burgess has provided introductions to each of the three parts of the volume, and also an afterword on Boolos's technical work in provability logic, which is beyond the scope of this volume. (shrink)

then E has a subset which is the domain of a model of Peano's axioms for the natural numbers. (This result is proved explicitly, using classical reasoning, in section 3 of [1].) My purpose in this note is to strengthen this result in two directions: first, the premise will be weakened so as to require only that the map ν be defined on the family of (Kuratowski) finite subsets of the set E, and secondly, the argument will be constructive, (...) i.e., will involve no use of the law of excluded middle. To be precise, we will prove, in constructive (or intuitionistic) set theory3, the following.. (shrink)

It is argued that models of H. Jeffreys' axioms of probability (Jeffreys [1939] 1967) are not monotone even with I. J. Good's proposed modification (Good 1950). Hence the additivity axiom seems essential to a theory of probability as it is with Kolmogorov's system (Kolmogorov 1950).

We present a solution to the problem of defining a counterpart in Algebraic Set Theory of the construction of internal sheaves in Topos Theory. Our approach is general in that we consider sheaves as determined by Lawvere-Tierney coverages, rather than by Grothendieck coverages, and assume only a weakening of the axioms for small maps originally introduced by Joyal and Moerdijk, thus subsuming the existing topos-theoretic results.

Although we believe the results reported below to have direct philosophical import, we shall for the most part confine our remarks to the realm of mathematics. The reader is referred to [4] for a philosophically oriented discussion, comprehensible to mathematicians, of tense logic.The “minimal” tense logicT0is the system having connectives ∼, →,F(“at some future time”), andP(“at some past time”); the following axioms:(whereGandHabbreviate ∼F∼ and ∼P∼ respectively); and the following rules:(8) fromαandα → β, inferβ,(9) fromα, infer any substitution instance ofα,(10) (...) fromα, inferGα,(11) fromα, inferHα.A tense logic is a systemTwhose language is that ofT0and whose axioms and rules include (1)–(11). The axioms and rules ofTother than (1)–(11) are calledproperaxioms and rules.We shall investigate three systems of semantics for tense logics, i.e. three notions ofstructureand three relations ⊧ which stand between structures and formulas. One reads⊧αas “αis valid in.” A structureis amodelof a tense logicTif every formula provable inTis valid in. A semantics isadequateforTif the set of models ofTin the semantics is characteristic forT, i.e. if wheneverT ∀ αthen there is a modelofTin the semantics such that∀ α. Two structuresand, possibly from different semantics, are calledequivalent(∼) if exactly the same formulas are valid inas in. (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)

Let denote a first‐order logic in a language that contains infinitely many constant symbols and also containing intuitionistic logic. By, we mean the associated logic axiomatized by the double negation of the universal closure of the axioms of plus. We shall show that if is strongly complete for a class of Kripke models, then is strongly complete for the class of Kripke models that are ultimately in.

ArgumentIn theAlmagest, Ptolemy finds that the apogee of Mercury moves progressively at a speed equal to his value for the rate of precession, namely one degree per century, in the tropical reference system of the ecliptic coordinates. He generalizes this to the other planets, so that the motions of the apogees of all five planets are assumed to be equal, while the solar apsidal line is taken to be fixed. In medieval Islamic astronomy, one change in this general proposition took (...) place because of the discovery of the motion of the solar apogee in the ninth century, which gave rise to lengthy discussions on the speed of its motion. Initially Bīrūnī and later Ibn al-Zarqālluh assigned a proper motion to it, although at different rates. Nevertheless, appealing to the Ptolemaic generalization and interpreting it as a methodological axiom, the dominant idea became to extend it in order to include the motion of the solar apogee as well. Another change occurred after correctly making a distinction between the motion of the apogees and the rate of precession. Some Western Islamic astronomers generalized Ibn al-Zarqālluh's proper motion of the solar apogee to the apogees of the planets. Analogously, Ibn al-Shāṭir maintained that the motion of the apogees is faster than precession. Nevertheless, the Ptolemaic generalization in the case of the equality of the motions of the apogees remained untouchable, despite the notable development of planetary astronomy, in both theoretical and observational aspects, in the late Islamic period. (shrink)

The paper advocates an epistemological interpretation of the Peano School axiomatics. The construction of axiom systems is presented as a cognitive enterprise unveiling the internal dynamics, evolution, and architecture of axiomatic systems as well as connections to applications. This approach reveals that the study of the relation between axioms and theorems not only serves to reduce a theory to a minimum number of principles and increase the certainty or justification of the latter, but also to study alternative settings of (...) a given mathematical theory. The paper explains why the Peanian conception of axiomatics differs from axiomatic deductivism, if-thenism and scientific deductivism, and analyzes Peano’s conception of rigor. The paper also postulates that Peano had a set-theoretic but also an algorithmic conception of function, and prioritized functions over relations. Two seemingly contradictory aspects of Peano’s axiomatics, global and local reasoning, are illustrated through the examples of rigor and simplicity. Finally, the paper claims that Peano’s axiomatics was a dynamic mathematical enterprise rather than an a priori axiomatization grounded on logical principles, which explains the difference with respect to Frege’s project. (shrink)

The purpose of this paper is to make a simple observation regarding the Johnson -Carnap continuum of inductive methods. From the outset, a common criticism of this continuum was its failure to permit the confirmation of universal generalizations: that is, if an event has unfailingly occurred in the past, the failure of the continuum to give some weight to the possibility that the event will continue to occur without fail in the future. The Johnson -Carnap continuum is the mathematical consequence (...) of an axiom termed Johnson 's sufficientness postulate, the thesis of this paper is that, properly viewed, the failure of the Johnson -Carnap continuum to confirm universal generalizations is not a deep fact, but rather an immediate consequence of the sufficientness postulate; and that if this postulate is modified in the minimal manner necessary to eliminate such an entailment, then the result is a new continuum that differs from the old one in precisely one respect: it enjoys the desideratum of confirming universal generalizations. (shrink)

This paper contributes to the generalization of lattice-valued models of set theory to non-classical contexts. First, we show that there are infinitely many complete bounded distributive lattices, which are neither Boolean nor Heyting algebra, but are able to validate the negation-free fragment of \. Then, we build lattice-valued models of full \, whose internal logic is weaker than intuitionistic logic. We conclude by using these models to give an independence proof of the Foundation axiom from \.

We prove the following Main Theorem: $ZF + AD + V = L(R) \Rightarrow DC$ . As a corollary we have that $\operatorname{Con}(ZF + AD) \Rightarrow \operatorname{Con}(ZF + AD + DC)$ . Combined with the result of Woodin that $\operatorname{Con}(ZF + AD) \Rightarrow \operatorname{Con}(ZF + AD + \neg AC^\omega)$ it follows that DC (as well as AC ω ) is independent relative to ZF + AD. It is finally shown (jointly with H. Woodin) that ZF + AD + ¬ DC (...) R , where DC R is DC restricted to reals, implies the consistency of ZF + AD + DC, in fact implies R # (i.e. the sharp of L(R)) exists. (shrink)

In [10] Friedman showed that is a conservative extension of <ε0for-sentences wherei= min, i.e.,i= 2, 3, 4 forn= 0, 1, 2 +m. Feferman [5], [7] and Tait [11], [12] reobtained this result forn= 0, 1 and even with instead of. Feferman and Sieg established in [9] the conservativeness of over <ε0for-sentences for alln. In each paper, different methods of proof have been used. In particular, Feferman and Sieg showed how to apply familiar proof-theoretical techniques by passing through languages with Skolem (...) functionals.In this paper we study the same choice principles in the presence of theBar Rule, which permits one to infer the scheme of transfinite induction on a primitive recursive relation ≺ when it has been proved that ≺ is wellfounded. The main result characterizes + as a conservative extension of a system of the autonomously iterated-comprehension axiom for-sentences. Forn= 0 this has been proved by Feferman in the form that + is a conservative extension of <Γ0; this was first done in [8] by use of the Gödel functional interpretation for the stronger systemZω+μ+ + and then more recently by the simpler methods of [9]. Jäger showed how the latter methods could also be used to obtain the general result of Theorem 1 below. (shrink)

With regards to the inefficiencies and uncompromising situations within the humanities and social sciences field in Iran, the challenge of problematizing these sciences is inevitable. So far, numerous research analyzing humanities and social sciences’ problems in the Iranian academic system have been published. Considering the important role of humanities and social sciences in the modern Iranian society, we attempt to suggest a theoretical framework for the problematization of humanities and social sciences in Iran. The exploration of the main challenges facing (...) humanities and social sciences in Iran from the community, academy and administration point of view, sparks three hypotheses. First, humanities and social sciences’ theories and teachings are not applied accurately. Second, the humanities and social sciences’ schools of thought are not chosen properly according to Iranian circumstances. And third, there are metaphysical differences between axioms and presupposition of humanities and social sciences having western origins and those with Islamic-Iranian culture. (shrink)

The regular extension axiom, REA, was first considered by Peter Aczel in the context of Constructive Zermelo-Fraenkel Set Theory as an axiom that ensures the existence of many inductively defined sets. REA has several natural variants. In this note we gather together metamathematical results about these variants from the point of view of both classical and constructive set theory.

In a famous lecture in 1900, David Hilbert listed 23 difficult problems he felt deserved the attention of mathematicians in the coming century. His conviction of the solvability of every mathematical problem was a powerful incentive to future generations: ``Wir müssen wissen. Wir werden wissen.'' (We must know. We will know.) Some of these problems were solved quickly, others might never be completed, but all have influenced mathematics. Later, Hilbert highlighted the need to clarify the methods of mathematical reasoning, using (...) a formal system of explicit assumptions, or axioms. Hilbert's vision was the culmination of 2,000 years of mathematics going back to Euclidean geometry. He stipulated that such a formal axiomatic system should be both `consistent' (free of contradictions) and `complete' (in that it represents all the truth). Hilbert also argued that any wellposed mathematical problem should be `decidable', in the sense that there exists a mechanical procedure, a computer program, for deciding whether something is true or not. Of course, the only problem with this inspiring project is that it turned out to be impossible. (shrink)

In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut if and only if the type of a is selective. We extend this result by showing that if M is a countable arithmetically saturated model of Peano Arithmetic, Ω ⊂ M is a very good interstice, and a (...) ∈ Ω, then the stabilizer of a is a maximal subgroup of Aut if and only if the type of a is selective and rational. (shrink)

J. D. Monk has shown that for first order languages with finitely many variables there is no finite set of schema which axiomatizes the universally valid formulas. There are such finite sets of schema which axiomatize the formulas valid in all structures of some fixed finite size.

Shepherdson [14] showed that for a discrete ordered ring I, I is a model of IOpen iff I is an integer part of a real closed ordered field. In this paper, we consider integer parts satisfying PA. We show that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ₄), then R must be recursively saturated. In particular, the real closure of I, RC (I), is recursively saturated. We (...) also show that if R is a countable recursively saturated real closed ordered field, then there is an integer part I such that R = RC(I) and I is a nonstandard model of PA. (shrink)