Related papers: Models of Set Theory: Extensions and Dead-ends

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…

A non-quantitative version of the Freiman-Ruzsa theorem is obtained for finite stable sets with small tripling in arbitrary groups, as well as for (finite) weakly normal subsets in abelian groups.

In this note, we present a puzzle. We prove that Zermelo-Fraenkel set theory is inconsistent by proving, using Zermelo-Fraenkel set theory, the false statement that any algorithm that determines whether any $n \times n$ matrix over $\mathbb…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Let $R$ be a discrete valuation ring of field of fractions $K$ and of residue field $k$ of characteristic $p > 0$. In an earlier work, we studied the question of extending torsors on $K$-curves into torsors over $R$-regular models of the…

We develop a theory of extensions of hyperfields that generalizes the notion of field extensions. Since hyperfields have a multivalued addition, we must consider two kinds of extensions that we call weak hyperfield extensions and strong…

We argue that the language of Zermelo Fraenkel set theory with definitions and partial functions provides the most promising bedrock semantics for communicating and sharing mathematical knowledge. We then describe a syntactic sugaring of…

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

We study etale extensions of rings that have FIP.

We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is…

This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and…

Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…

We consider mainly the following version of set theory:"ZF + DC and for every $\lambda,\lambda^{\aleph_0}$ is well ordered", our thesis is that this is a reasonable set theory, e.g. much can be said. In particular, we prove that for a…

In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor $Jf:F\rightarrow Sets$ where $F$ is the category with the set of objects…

This paper introduces a new theory which encompasses concepts and ideas from set theory, type theory, and Le\'{s}niewski's mereology and describes its possibility as an alternative foundation for mathematics. In the introduction section I…

The set-theoretical model of Goedel's system T is not fully abstract. We also briefly discuss fully abstract models of system T.

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

It is consistent with ZF set theory that the Euclidean topology on the real line is not sequential, yet every infinite set of reals contains a countably infinite subset. This answers a question of Gutierres.

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…