Related papers: On Cantor's Theorem
When working in NF, [1] there is a sense that there are more non-Cantorian sets than Cantorian sets. But it is not that immediate result as one expects, since they are externally equinumerous, and the qualification "Cantorian" is not…
The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…
Traditional mathematical notation can lead to confusion. Expressions that appear to define composite functions sometimes do not. A particular example with engineering applications is studied in detail.
We prove a Khintchine type theorem for approximation of elements in the Cantor set, as a subset of the formal Laurent series over $\mathbb{F}_3$, by rational functions of a specific type. Furthermore we construct elements in the Cantor set…
One classical theory, as determined by an equation of motion or set of classical trajectories, can correspond to many unitarily {\em in}equivalent quantum theories upon canonical quantization. This arises from a remarkable ambiguity, not…
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…
The notion of rough set captures indiscernibility of elements in a set. But, in many real life situations, an information system establishes the relation between different universes. This gave the extension of rough set on single universal…
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…
Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
Statistical modeling is a powerful tool for developing and testing theories by way of causal explanation, prediction, and description. In many disciplines there is near-exclusive use of statistical modeling for causal explanation and the…
A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.
We show that some mathematical results and their negations are both deducible. The derived contradictions indicate the inconsistency of current mathematics. This paper is an updated version of arXiv:math/0606635v3 with additional results…
Many widely different problems have a common mathematical structure wherein limited knowledge lead to ambiguity that can be captured conveniently using a concept of invisibility that requires the introduction of negative values for…
We present a theory of information expressed solely in terms of which transformations of physical systems are possible and which are impossible - i.e. in constructor-theoretic terms. Although it includes conjectured laws of physics that are…
We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…
Menger conjectured that subsets of R with the Menger property must be ${\sigma}$-compact. While this is false when there is no restriction on the subsets of R, for projective subsets it is known to follow from the Axiom of Projective…
This study describes such a situation that a Cantor set emerges as a result of the exploration of sufficient conditions for the property which is generalized from fundamental chaotic maps, and the Cantor set even guarantees infinitely many…
Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…
The mathematical software \texttt{GAP} (Groups, Algorithms, Programming) offers a powerful set of tools to investigate computationally group theory. Using this software package we investigate a variation of a well-known problem in…