相关论文: The Largest Countable Inductive Set is a Mouse Set

The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…

In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…

Let $M$ be a fine structural mouse and let $F\in M$ be such that $M\models$``$F$ is a total extender'' and $(M||\mathrm{lh}(F),F)$ is a premouse. We show that it follows that $F\in\mathbb{E}^M$, where $\mathbb{E}^M$ is the extender sequence…

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…

Let kappa be an uncountable regular cardinal. Assuming 2^kappa=kappa^+, we show that the clone lattice on a set of size kappa is not dually atomic.

We show that (in ZFC) every infinite set S can be equipped with 2^|S| complete metrics which generate mutually non-homeomorphic scattered order topologies on S. Furthermore, we show that (in ZFC) every uncountable set S can be equipped with…

We show that the existence of a Pi^{1}_{N}-indescribable cardinal over the Zermelo-Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and lower Mahlo operations. Furthermore we describe a…

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,…

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…

The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…

We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…

In [8] the second and third authors showed that if the least inaccessible cardinal is the least measurable cardinal, then there is an inner model with $o(\kappa)\geq2$. In this paper we improve this to $o(\kappa)\geq\kappa+1$ and show that…

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…

We prove that any definable family of subsets of a definable infinite set $A$ in an o-minimal structure has cardinality at most $|A|$. We derive some consequences in terms of counting definable types and existence of definable topological…

Douglass B. Morris announced in 1970 that it is consistent with ZF that "For every $\alpha$, there exists a set $A_\alpha$ which is the countable union of countable sets, and $\mathcal P(A_\alpha)$ can be partitioned into $\aleph_\alpha$…

It is shown that the existence of a measurable cardinal is equiconsistent to a model of ZFC in which there is no ordinal-definable, stationary, costationary subset of $\omega_1$