Related papers: Countability conditions in locally solid convergen…

We study the relationship between many natural conditions that one can put on a diffeological vector space: being fine or projective, having enough smooth (or smooth linear) functionals to separate points, having a diffeology determined by…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…

We prove the stability of the Gieseker point of an irreducible homogeneous bundle over a rational homogeneous space. As an application we get a sharp upper estimate for the first eigenvalue of the Laplacian of an arbitrary Kaehler metric on…

We characterize the finite dimensional asymmetric normed spaces which are right bounded and the relation of this property with the natural compactness properties of the unit ball, as compactness and strong compactness. In contrast with some…

We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of…

While topology given by a linear order has been extensively studied, this cannot be said about the case when the order is given only locally. The aim of this paper is to fill this gap. We consider relation between local orderability and…

Among cocomplete categories, the locally presentable ones can be defined as those with a strong generator consisting of presentable objects. Assuming Vop{\v{e}}nka's Principle, we prove that a cocomplete category is locally presentable iff…

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Let X be an affine variety and L be a solvable Lie subalgebra of Lie(Aut(X)) generated by a finite collection of locally finite Lie subalgebras. The authors of [arXiv:2507.09679] wondered whether L is itself locally finite. Here we present…

We prove the existence and uniqueness of geometric models of local isometry classes of locally homogeneous spaces with sectional curvature $|\operatorname{sec}|\leq 1$. Moreover, we show that the set of geometric models is compact in the…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

A compact space X is I-favorable if, and only if X can be representing as a limit of $\sigma$-complete inverse system of compact metrizable spaces with skeletal bonding maps.

A dual pair formulation for asymmetric locally convex spaces is developed that strictly generalises the ordinary vector space setting. The concept of a polar topology carries over to the asymmetric case and some familiar results are…

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

We consider 9 natural tightness conditions for topological spaces that are all variations on countable tightness and investigate the interrelationships between them. Several natural open problems are raised.

We consider ergodic $\mathrm{Sym}(\mathbb{N})$-invariant probability measures on the space of $L$-structures with domain $\mathbb{N}$ (for $L$ a countable relational language), and call such a measure a properly ergodic structure when no…

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…