Related papers: Approximate Categoricity in Continuous Logic

We introduce a framework for universal algebra in categories of relational structures given by finitary relational signatures and finitary or infinitary Horn theories, with the arity $\lambda$ of a Horn theory understood as a strict upper…

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Within the extension of the $\Lambda$CDM model, allowing for the presence of neutrinos or warm dark matter, we develop the analytical cosmological perturbation theory. It covers all spatial scales where the weak gravitational field regime…

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Relative entropy is a fundamental class of distances between probability distributions, with widespread applications in probability theory, statistics, and machine learning. In this work, we study relative entropy from a categorical…

We develop a new forcing notion for adjoining self-coding cofinitary permutations and use it to show that consistently, the minimal cardinality $\mathfrak a_{\text{g}}$ of a maximal cofinitary group (MCG) is strictly between $\aleph_1$ and…

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

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.…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

We introduce the notion of weighted limit in an arbitrary quasi-category, suitably generalizing ordinary limits in a quasi-category, and classical weighted limits in an ordinary category. This is accomplished by generalizing Joyal's…

Let $E$ be an analytic equivalence relation on a Polish space. We introduce a framework for studying the possible "reasonable" complete classifications and the complexity of possible classifying invariants for $E$, such that: (1) the…

We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…

For an abstract elementary class $\mathbf{K}$ and a cardinal $\lambda \geq LS(\mathbf{K})$, we prove under mild cardinal arithmetic assumptions, categoricity in two succesive cardinals, almost stability for $\lambda^+$-minimal types and…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

We give a classification of all exact structures on a given idempotent complete additive category. Using this, we investigate the structure of an exact category with finitely many indecomposables. We show that the relation of the…

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Generalizing classical descriptive set theory opens foundational questions about the Borel hierarchy. In this paper we systematically study those questions, working in the general framework of Polish-like spaces relative to an uncountable…

We revisit the classical concept of near-decomposability in complex systems, introduced by Herbert Simon in his foundational article The Architecture of Complexity, by developing an explicit quantitative analysis based on singular…