SearcharxivSearch

arXiv · 2011.12628

Procedures of Leibnizian infinitesimal calculus: An account in three modern frameworks

Abstract

Recent Leibniz scholarship has sought to gauge which foundational framework provides the most successful account of the procedures of the Leibnizian calculus (LC). While many scholars (e.g., Ishiguro, Levey) opt for a default Weierstrassian framework, Arthur compares LC to a non-Archimedean framework SIA (Smooth Infinitesimal Analysis) of Lawvere-Kock-Bell. We analyze Arthur's comparison and find it rife with equivocations and misunderstandings on issues including the non-punctiform nature of the continuum, infinite-sided polygons, and the fictionality of infinitesimals. Rabouin and Arthur claim that Leibniz considers infinities as contradictory, and that Leibniz' definition of incomparables should be understood as nominal rather than as semantic. However, such claims hinge upon a conflation of Leibnizian notions of bounded infinity and unbounded infinity, a distinction emphasized by early Knobloch. The most faithful account of LC is arguably provided by Robinson's framework. We exploit an axiomatic framework for infinitesimal analysis called SPOT (conservative over ZF) to provide a formalisation of LC, including the bounded/unbounded dichotomy, the assignable/inassignable dichotomy, the generalized relation of equality up to negligible terms, and the law of continuity.

Explore related subjects

Keep this discovery

BibTeXRIS

Jacques Bair, Piotr Blaszczyk, Robert Ely, Mikhail G. Katz, Karl Kuhlemann. 2020-11-25. Procedures of Leibnizian infinitesimal calculus: An account in three modern frameworks. https://doi.org/10.1080/26375451.2020.1851120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO