Related papers: Debunking Cantor: New Set-Theoretical and Logical …
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…
In this article some difficulties are deduced from the set of natural numbers. By using the method of transfinite recursion we define an iterative process which is designed to deduct all the non-greatest elements of the set of natural…
Alternative set theory was created by the Czech mathematician Petr Vop\v enka in 1979 as an alternative to Cantor's set theory. Vop\v enka criticised Cantor's approach for its loss of correspondence with the real world. Alternative set…
The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…
The methodology used here might provide a neat method of examining paradoxes and ways to circumvent them. Most of the known set theoretic paradoxes (Russell's, Cantor's, Burali-Forti's,..) can be paralleled here and examined. This account…
We offer a new proof (and review some known proofs) of Cantor's Powerset Theorem (1891), which concerns the non-existence of a surjective function from a set onto its powerset.
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
In this paper we discuss several variations and generalizations of the Cantor set and study some of their properties. Also for each of those generalizations a Cantor-like function can be constructed from the set. We will discuss briefly the…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
In which a review of the concept of countability is done in mathematics, subjecting review some of the theorems so far accepted, showing their inconsistency and also taking concrete elements on the countability of all the powers of the set…
The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the…
We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
Cantor gave in his fundamental article an elegant proof of the countability of real algebraic numbers based on a positive integer height, denoted by him as N, of integer and irreducible polynomials of given degree (denoted by him as n) with…
A class of ultrametric Cantor sets $(C, d_{u})$ introduced recently in literature (Raut, S and Datta, D P (2009), Fractals, 17, 45-52) is shown to enjoy some novel properties. The ultrametric $d_{u}$ is defined using the concept of {\em…
The present article is devoted to representations of rational numbers in terms sign-variable Cantor expansions. The main attention is given to one of the discussions given by J. Galambos in [4].
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
Czachor's recent proposal introduces a form of non-Newtonian calculus built by pulling back arithmetic operations through arbitrary bijections between continua. Although the idea is mathematically inventive, it runs into serious conceptual…