Related papers: Complexity of Ramsey null sets

We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

If ZFC is consistent, then each of the following are consistent with ZFC + 2^{{aleph_0}}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong…

The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…

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…

Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…

The Ramsey Choice principle for families of $n$-element sets, denoted $\mathrm{RC}_n$, states that every infinite set $X$ has an infinite subset $Y\subseteq X$ with a choice function on $[Y]^n := \{z\subseteq Y : |z| = n\}$. We investigate…

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

It is consistent with constructive set theory (without Countable Choice, clearly) that the Cauchy reals (equivalence classes of Cauchy sequences of rationals) are not Cauchy complete. Related results are also shown, such as that a Cauchy…

On a real ($\mathbb F=\mathbb R$) or complex ($\mathbb F=\mathbb C$) analytic connected 2-manifold $M$ with empty boundary consider two vector fields $X,Y$. We say that $Y$ {\it tracks} $X$ if $[Y,X]=fX$ for some continuous function…

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes…

We investigate the existence of a class of ZFC-provably total recursive unary functions, given certain constraints, and apply some of those results to show that, for $\Sigma_1$-sound set theory, ZFC$\not\vdash P<NP$.

We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in $[0,\frac{1}{3}]$, answering a question of Cameron, and that the number of those…

Given a variation of Hodge structures on a quasi-projective base $S$, whose generic Mumford-Tate group is non-product, we prove that the (countable) union of positive components of the Hodge locus is either an algebraic subvariety of $S$,…

There has been a recent interest in hierarchical generalisations of classic incompleteness results. This paper provides evidence that such generalisations are readibly obtainable from suitably hierarchical versions of the principles used in…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

We prove that if an analytic subset $A$ of a linear metric space $X$ is not contained in a $\sigma Z_\omega$-subset of $X$ then for every Polish convex set $K$ with dense affine hull in $X$ the sum $A+K$ is non-meager in $X$ and the sets…