Related papers: Bolzano's Infinite Quantities
The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…
We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…
It is a widespread belief that results like G\"odel's incompleteness theorems or the intrinsic randomness of quantum mechanics represent fundamental limitations to humanity's strive for scientific knowledge. As the argument goes, there are…
Motivated by quantum states with zero transition probability, we introduce the notion of ortho-set which is a set equipped with a relation $\neq_\mathrm{q}$ satisfying: $x\neq_\mathrm{q} y$ implies both $x\neq y$ and $y \neq_\mathrm{q} x$.…
The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…
We introduce axiomatically the ring $\bf{Z}_\kappa$ of the Euclidean integers, that can be viewed as the ``integral part" of the field $\mathbb{E}$ of Euclidean numbers of [4], where the transfinite sum of ordinal indexed $\kappa$-sequences…
The uncountability of $\mathbb{R}$ is one of its most basic properties, known far outside of mathematics. Cantor's 1874 proof of the uncountability of $\mathbb{R}$ even appears in the very first paper on set theory, i.e. a historical…
We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…
In a series of papers in the last ten years, various aspects of the mathematical foundations of the quantum theory of atoms in molecules have been considered by this author and his coworkers in some details. Although these considerations…
This paper extends the tools of C*-algebraic strict quantization toward analyzing the classical limits of unbounded quantities in quantum theories. We introduce the approach first in the simple case of finite systems. Then we apply this…
In this paper we prove that the set of countable bqos (viewed as a subset of the Cantor space) is Pi^1_2-complete. The notion of bqo or better quasi-ordering arises from combinatorics and is a generalization of the canonical example of a…
A mathematical framework is proposed for the "big bang". It starts with some Cantor set and assumes the existence of a transformation from that set to the continuum set used in conventional physical theories like general relativity and…
For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…
A pattern is called universal in another collection of sets, when every set in the collection contains some linear and translated copy of the original pattern. Paul Erd\H{o}s proposed a conjecture that no infinite set is universal in the…
Natural philosophy integrates scientific observation with abstract frameworks, often using a mathematical Ansatz to hypothesise about physical phenomena. Exploring the possibility of other universes, however, challenges assumptions that…
An ultraproduct can be a helpful organizing principle in presenting solutions of problems at many levels, as argued by Terence Tao. We apply it here to the solution of a calculus problem: every infinite sequence has a monotone infinite…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…