Related papers: Counterexamples to Cantorian Set Theory
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…
Recent work on the representation of functions on sets has considered the use of summation in a latent space to enforce permutation invariance. In particular, it has been conjectured that the dimension of this latent space may remain fixed…
For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
We discuss how singular can cardinals be in absence of the axiom of choice. We show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. Then we pose some problems.
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
The framework of a new scale invariant analysis on a Cantor set $C\subset $ $% I=[0,1] $, presented originally in {\it S. Raut and D. P. Datta, Fractals, 17, 45-52, (2009)}, is clarified and extended further. For an arbitrarily small…
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
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…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…
We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to Martin-Lof random reals, identify a point with lower…
Goodstein's argument is essentially that the hereditary representation m_{[b]} of any given natural number m in the natural number base b can be mirrored in Cantor Arithmetic, and used to well-define a finite decreasing sequence of…
We construct a class of homogeneous Cantor-Moran measures with all contraction ratios being reciprocal of integers, and prove that they are pointwise absolutely normal. Our approach relies on methods developed by Davenport, Erd{\H{o}}s, and…
Reverse Mathematics is a program in the foundations of mathematics which provides an elegant classification of theorems of ordinary mathematics based on computability. Our aim is to provide an alternative classification of theorems based on…
Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…
We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers,…