Related papers: Definable ${\mathsf E}_0$ classes at arbitrary pro…
Many moduli spaces that occur in geometric analysis admit "Fredholm-stratified thin compactifications" in the sense of [IP1] and hence admit a relative fundamental class (RFC), also as defined in [IP1]. We extend these results, emphasizing…
A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…
In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…
We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…
If ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms introduced by Hamkins.
I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results…
A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…
We realise the algebra $\mathcal W$, the algebra $\mathcal Z_0$ and the algebras $\mathcal Z_0\otimes A$, where $A$ is a unital UHF algebra as Fra\"iss\'e limits of suitable classes of structures. In doing so, we show that such algebras are…
Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…
To answer a question by Rettich and Serafin, we define a model of set theory in which there exists a locally countable $\varPi^1_2$ graph on a subset of the real line, which is not generated by a countable family of projective (or even…
We discuss how to write down three specific natural numbers $A$, $B$, $C$ such that for any real number $r$ you've probably ever thought of, it is consistent with $\mathsf{ZFC}$ set theory that $$\def\Rb{\mathbb{R}}\def\Nb{\mathbb{N}}r =…
We show that if $\kappa \leq \omega$ and there exists a group topology without non-trivial convergent sequences on an Abelian group $H$ such that $H^n$ is countably compact for each $n<\kappa$ then there exists a topological group $G$ such…
We construct new models of $ZF$ with an uncountable set of reals that has a unique condensation point. This addresses a question by Sierpi\'{n}ski from 1918.
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…
In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…
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.
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 construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…
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…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…