Related papers: A Sacks indestructible co-analytic maximal eventua…

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other…

We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the basic existence results. We prove that MA implies there exist many pairwise…

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

We construct a Borel maximal eventually different family.

We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an…

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

We study ultrafilters on countable sets and reaping families which are indestructible by Sacks forcing. We deal with the combinatorial characterization of such families and we prove that every reaping family of size smaller than the…

We give a combinatorial characterization of when a maximal almost disjoint family of a weakly compact cardinal $\kappa$ is indestructible by the higher random forcing $\mathbb Q_\kappa$. We then use this characterisation to show that…

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

We prove that the spectrum of Van Douwen families is closed under singular limits. For any maximal eventually different family Raghavan defined in an associated ideal which measures how far the family is from being Van Douwen. Under CH we…

For Van Douwen families, maximal families of eventually different permutations and maximal ideal independent families we show that the existence of a $\Sigma^1_2$ family implies the existence of a $\Pi^1_1$ family of the same size. We also…

Assuming that every set is constructible, we find a $\Pi^1_1$ maximal cofinitary group of permutations of $\mathbb N$ which is indestructible by Cohen forcing. Thus we show that the existence of such groups is consistent with arbitrarily…

The notion of constructible functions in the setting of tame real geometry has been introduced by Cluckers and Dan Miller in their work on parametric integration of globally subanalytic functions. A function on a globally subanalytic set is…

Let $A\subset \mathbb{N}^{n}$ be an $r$-wise $s$-union family, that is, a family of sequences with $n$ components of non-negative integers such that for any $r$ sequences in $A$ the total sum of the maximum of each component in those…

Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…

We study the join-semilattice of constructibility real degrees in the side-by-side Sacks model, the model of set theory obtained by forcing with a countable-support product of infinitely many Sacks forcings over the constructible universe.…

Factoring out the spin $1$ subalgebra of a $ W $ algebra leads to a new $ W $ structure which can be seen either as a rational finitely generated $ W $ algebra or as a polynomial non-linear $ W_\infty$ realization.

We prove that the generic maximal independent family obtained by iteratively forcing with the Mathias forcing relative to diagonalization filters is densely maximal. Moreover, by choosing the filters with some care one can ensure the family…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…