Related papers: The Largest Countable Inductive Set is a Mouse Set

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

A function f from reals to reals (f:R->R) is almost continuous (in the sense of Stallings) iff every open set in the plane which contains the graph of f contains the graph of a continuous function. Natkaniec showed that for any family F of…

This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…

A natural question, which appeared as Problem 61 in Hart and van Mill's list of open problems on $\beta\omega$ (2024), asks whether every finite partial order is embeddable in the Rudin--Keisler order on (types of) ultrafilters over a…

A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…

We prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the existence of large families of objects that are in some sense…

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…

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…

Using an invariant modification of Jensen's "minimal $\varPi^1_2$ singleton" forcing, we define a model of ZFC, in which, for a given $n\ge2$, there exists a lightface $\varPi^1_n$ unordered pair of non-OD (hence, OD-indiscernible)…