Related papers: The universal finite set
We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…
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}$…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…
We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.
The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set…
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is…
We study the completeness problem for propositionally quantified modal logics on quantifiable general frames, where the admissible sets are the propositions the quantifiers can range over and expressible sets of worlds are admissible, and…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
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 formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…