Related papers: Classification problems from the descriptive set t…
Let K be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map.…
The aim of the paper is to give a full classification of factorizations of groups in terms of descent cohomology (pointed) sets introduced in [5]. We show that descent cohomology includes Serre's non-abelian group cohomology as a special…
We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…
For more than a century, Cantor's theory of transfinite numbers has played a pivotal role in set theory, with ramifications that extend to many areas of mathematics. This article extends earlier findings with a fresh look at the critical…
Let $A$ be an associative ring and $M$ a finitely generated projective $A$-module. We introduce a category $\operatorname{RBS}(M)$ and prove several theorems which show that its geometric realisation functions as a well-behaved unstable…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…
The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by…
We prove independence of normality to different bases We show that the set of real numbers that are normal to some base is Sigma^0_4 complete in the Borel hierarchy of subsets of real numbers. This was an open problem, initiated by…
This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…
We investigate Keisler measures in arbitrary theories. Our initial focus is on Borel definability. We show that when working over countable parameter sets in countable theories, Borel definable measures are closed under Morley products and…
An introductory guide to mathematical cosmology is given focusing on the issue of the genericity of various important results which have been obtained during the last thirty or so years. Some of the unsolved problems along with certain new…
We present a detailed study of cardinality-aware top-$k$ classification, a novel approach that aims to learn an accurate top-$k$ set predictor while maintaining a low cardinality. We introduce a new target loss function tailored to this…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
Recent years have witnessed many successful applications of contrastive learning in diverse domains, yet its self-supervised version still remains many exciting challenges. As the negative samples are drawn from unlabeled datasets, a…
We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…