相关论文: Infinitesimal analysis without the Axiom of Choice
Model-theoretic frameworks for Nonstandard Analysis depend on the existence of nonprincipal ultrafilters, a strong form of the Axiom of Choice (AC). Hrbacek and Katz, APAL 72 (2021) formulate axiomatic nonstandard set theories SPOT and SCOT…
We survey the effective foundations for analysis with infinitesimals developed by Hrbacek and Katz in 2021, and detail some applications. Theories SPOT and SCOT are conservative over respectively ZF and ZF+ADC. The range of applications of…
We provide choiceless proofs using infinitesimals of the global versions of Peano's existence theorem and Osgood's theorem on maximal solutions. We characterize all solutions in terms of infinitesimal perturbations. Our proofs are more…
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…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
We introduce the ring of Fermat reals, an extension of the real field containing nilpotent infinitesimals. The construction takes inspiration from Smooth Infinitesimal Analysis (SIA), but provides a powerful theory of actual infinitesimals…
Using a recent alternative to Tarskian semantics for first-order logic, known as $\textit{possibility semantics}$, I introduce an alternative approach to nonstandard analysis that remains within the bounds of \textit{semi-constructive}…
In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…
A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…
This paper aims to build a new understanding of the nonstandard mathematical analysis. The main contribution of this paper is the construction of a new set of numbers, $\mathbb{R}^{\mathbb{Z}_< }$, which includes infinities and…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two…
We give a proof of an infinitary version of the well known Hales-Jewett theorem on finite words avoiding the use of ultrafilters.
This commentary considers non-standard analysis and a recently introduced computational methodology based on the notion of \G1 (this symbol is called \emph{grossone}). The latter approach was developed with the intention to allow one to…
An alternative mathematics based on qualitative plurality of finiteness is developed to make non-standard mathematics independent of infinite set theory. The vague concept "accessibility" is used coherently within finite set theory whose…
This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
We develop a new semantics for defeasible inference based on extended probability measures allowed to take infinitesimal values, on the interpretation of defaults as generalized conditional probability constraints and on a preferred-model…
It is well-known that a finite axiomatization of Zermelo-Fraenkel set theory (ZF) is not possible in the same first-order language. In this note we show that a finite axiomatization is possible if we extent the language of ZF with the new…