Related papers: On the limits of comparing subset sizes within $\m…
Demanding the existence of a simple holographic $c$-theorem, it is shown that a general (parity preserving) theory of gravity in 2+1 dimensions involving upto four derivative curvature invariants reduces to the new massive gravity theory.…
A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
In this paper we continue our research on the concept of liken. This notion has been defined as a sequence of non-negative real numbers, tending to infinity and closed with respect to addition in $\mathbb{R}$. The most important examples of…
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities.…
We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
We show (in ZFC) that the cardinality of a compact homogeneous space of countable tightness is no more than the size of the continuum.
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…
Given a compact set of real numbers, a random $C^{m + \alpha}$-diffeomorphism is constructed such that the image of any measure concentrated on the set and satisfying a certain condition involving a real number $s$, almost surely has…
We develop new aspects of the the of numerosity theory; more exactly, we emphasize its relation with the ordinal numbers, cardinal numbers, hyperreal numbers and surreal numbers. In particular, we combine the notion of numerosity with the…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We investigate some properties of density measures -- finitely additive measures on the set of natural numbers $\N$ extending asymptotic density. We introduce a class of density measures, which is defined using cluster points of the…
Julia Robinson has given a first-order definition of the rational integers $\mathbb Z$ in the rational numbers $\mathbb Q$ by a formula $(\forall \exists \forall \exists)(F=0)$ where the $\forall$-quantifiers run over a total of 8…
Let $X$ be a compact metric space and let $|A|$ denote the cardinality of a set $A$. We prove that if $f\colon X\to X$ is a homeomorphism and $|X|=\infty$ then for all $\delta>0$ there is $A\subset X$ such that $|A|=4$ and for all $k\in Z$…
We study the smallest, as well as the largest numbers of congruences of lattices of an arbitrary finite cardinality $n$. Continuing the work of Freese and Cz\' edli, we prove that the third, fourth and fifth largest numbers of congruences…
Many set theorists point to the linearity phenomenon in the hierarchy of consistency strength, by which natural theories tend to be linearly ordered and indeed well ordered by consistency strength. Why should it be linear? In this paper I…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…
How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We define the \emph{rearrangement number}, a new cardinal…