Related papers: A countable definable set of reals containing no d…

The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

This is an expository paper in which I explain how core mathematics, particularly abstract analysis, can be developed within a concrete countable set J_2 (the second set in Jensen's constructible hierarchy). The implication, well-known to…

The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…

We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…

We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we…

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

Let $T$ be a complete local (Noetherian) ring. For each $i \in \mathbb{N}$, let $C_i$ be a nonempty countable set of nonmaximal pairwise incomparable prime ideals of $T$, and suppose that if $i \neq j$, then either $C_i = C_j$ or no element…

A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…

In various models of set theory, we consider covering Aleph_1 x Aleph_1 rectangles by countably many smooth curves, and we study differentiable isomorphisms between Aleph_1-dense sets of reals.

We identify the finite list of minimal analytic n-gaps which are not countably separated, and we prove that every analytic n-gap which is not countably separated contains a gap from our finite list.

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Suppose $a_n$ is a real, nonnegative sequence that does not increase exponentially. For any $p<1$ we contruct a Lebesgue measurable set $E \subseteq \mathbb{R}$ which has measure at least $p$ in any unit interval and which contains no…

For $C/\mathbb{Q}_p$ complete and algebraically closed, we show that the de Jong fundamental group $\pi_{1,\mathrm{dJ}}(\mathbb{P}^1_C)$ depends on $C$ and, if $C$ has cardinality $>2^{\mathbb{N}}$, that it is not topologically countably…

We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.

We construct uncountably many discrete groups of type $FP$; in particular we construct groups of type $FP$ that do not embed in any finitely presented group. We compute the ordinary, $\ell^2$- and compactly-supported cohomology of these…