Related papers: The universal finite set
A new axiom is proposed, the Ground Axiom, asserting that the universe is not a nontrivial set forcing extension of any inner model. The Ground Axiom is first-order expressible, and any model of ZFC has a class forcing extension which…
We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
It is shown that Vop\v{e}nka's Principle (VP) can restore almost the entire ZF over a weak fragment of it. Namely, if EST is the theory consisting of the axioms of Extensionality, Empty Set, Pairing, Union, Cartesian Product,…
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…
A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for…
$\aleph_1$-free groups, abelian groups for which every countable subgroup is free, exhibit a number of interesting algebraic and set-theoretic properties. In this paper, we give a complete proof that the property of being $\aleph_1$-free is…
This paper contains portions of Baldwin's talk at the Set Theory and Model Theory Conference (Institute for Research in Fundamental Sciences, Tehran, October 2015) and a detailed proof that in a suitable extension of ZFC, there is a…
A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…
I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
We construct a model of ZFC with a singular cardinal $\kappa$ such that every subset of $\kappa$ in $L(V_{\kappa+1})$ has both the $\kappa$-Perfect Set Property and the $\mathcal{\vec{U}}$-Baire Property. This is a higher analogue 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…
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…
Let $T$ be simple and $T^-$ a reduct of $T$. For variables $x$, we call an $\emptyset$-invariant set $\Gamma(x)$ of ${{\cal C}}$ with the property that for every formula $\phi^-(x,y)\in L^-$: for every $a$, $\phi^-(x,a)$ $L^-$-forks over…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
I shall explore various senses in which ultrafinitism can be fruitfully understood as engaging with a potentialist perspective in mathematics. First, I explain that every model $M$ of the theory of finite arithmetic -- arithmetic with a…
We extend the definition of quasi-finite complexes by considering not necessarily countable complexes. We provide a characterization of quasi-finite complexes in terms of L-invertible maps and dimensional properties of compactifications.…