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

We define a new inner model C2(omega) based on the fragment of second order logic in which second order variables range over countable subsets of the domain. We compare C2(omega) to the previously studied inner model C(aa). We argue that…

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…

We force the Axiom of Choice over the least initial segment of a Nairian model satisfying ZF. In the forcing extension, square_kappa fails at all uncountable cardinals kappa, and every regular cardinal is omega-strongly measurable in HOD,…

We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…

We analyze the hereditarily ordinal definable sets $\operatorname{HOD}$ in $M_n(x)[g]$ for a Turing cone of reals $x$, where $M_n(x)$ is the canonical inner model with $n$ Woodin cardinals build over $x$ and $g$ is generic over $M_n(x)$ for…

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…

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…