Related papers: Une initiation au concept de l'infini
Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
It is argued that every measurement is made in a certain scale. The scale in which present measuments are made is called present scale which gives present knowledge. Quantities at the limits to present measurement may be observables in…
The goal of this paper consists of developing a new (more physical and numerical in comparison with standard and non-standard analysis approaches) point of view on Calculus with functions assuming infinite and infinitesimal values. It uses…
This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of 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…
This is a survey of several approaches to the framework for working with infinitesimals and infinite numbers, originally developed by Abraham Robinson in the 1960s, and their constructive engagement with the Cantor-Dedekind postulate and…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…
Matthew Baker investigated, in previous work, an elegant, infinite-length game that may be used to study subsets of real numbers. We present two accessible examples of how an important technique from set theory, or a different technique…
Generalizing a geometric idea due to J. Sondow, we give a geometric proof for the Cantor's Theorem. Moreover, it is given an irrationality measure for some Cantor series.
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
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…
The Hausdorff-Alexandroff Theorem states that any compact metric space is the continuous image of Cantor's ternary set $C$. It is well known that there are compact Hausdorff spaces of cardinality equal to that of $C$ that are not continuous…
We study the exact Hausdorff and packing dimensions of the $prime$ $Cantor$ $set$, $\Lambda_P$, which comprises the irrationals whose continued fraction entries are prime numbers. We prove that the Hausdorff measure of the prime Cantor set…
In this article we discuss the transcendence of certain infinite sums and products by using the Subspace theorem. In particular we improve the result of Han\v{c}l and Rucki \cite{hancl3}.
A common question from students on the usual diagonalization proof for the uncountability of the set of real numbers is: when a representation of real numbers, such as the decimal expansions of real numbers, allows us to use the…
Over the course of the last 50 years, many questions in the field of computability were left surprisingly unanswered. One example is the question of $P$ vs $NP\cap co-NP$. It could be phrased in loose terms as "If a person has the ability…