相关论文: Splitting number

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

We can generalize the definition of {\it splitting number } $s(\kappa )$ for $\kappa$ uncountable regular: $s(\kappa )=min\{ |\Cal S|:\Cal S\subset \Cal P(\kappa ) \forall a\in \kappa ^\kappa \exists b\in \Cal S |a\cap b|=|a\setminus…

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $\omega$ implies that the modal logic S4.1.2 is complete with respect to the \v{C}ech-Stone compactification of the natural numbers,…

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

We prove that ZF+DC+"There are no mad families" is equiconsistent with ZFC.

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.

Let $X$ be an $n$-element set, where $n$ is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, according to which, for every maximal intersecting family $\mathcal{F}$ of $\frac{n}2$-element subsets of $X$, one can partition $X$…

We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every…

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…

The almost disjointness numbers associated to the quotients determined by the transfinite products of the ideal of finite sets are investigated. A $\mathrm{ZFC}$ lower bound involving the minimum of the classical almost disjointness and…

It is proved that any countable topological group in which the filter of neighborhoods of the identity element is not rapid contains a discrete set with precisely one nonisolated point. This gives a negative answer to Protasov's question on…

We prove that every Peano continuum with uncountably many local cut points is a topological fractal. This extends some recent results and it partially answers a conjecture by Hata. We also discuss the number of mappings which are necessary…

We address the question of whether a reflecting stationary set may be partitioned into two or more reflecting stationary subsets, providing various affirmative answers in ZFC. As an application to singular cardinals combinatorics, we infer…

Assuming the existence of a supercompact cardinal and an inaccessible above it, we construct a model of ZFC, in which all uncountable regular cardinals are inaccessible in HOD.

An infinite family of exactly-solvable and integrable potentials on a plane is introduced. It is shown that all already known rational potentials with the above properties allowing separation of variables in polar coordinates are particular…

For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.