English
Related papers

Related papers: Not every countable complete lattice is sober

200 papers

Hopf algebras, most generally in a semisimple abelian symmetric monoidal category, are here supposed to be commutative but not to be of finite-type, and their (equivariant) smoothness are discussed. Given a Hopf algebra $H$ in a category…

Rings and Algebras · Mathematics 2025-10-14 Kensuke Egami , Akira Masuoka , Kenta Suzuki

Michael asked whether every productively Lindel\"of space is powerfully Lindel\"of. Building of work of Alster and De la Vega, assuming the Continuum Hypothesis, we show that every productively Lindel\"of space of countable tightness is…

General Topology · Mathematics 2017-11-22 Andrea Medini , Lyubomyr Zdomskyy

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

Logic · Mathematics 2011-02-11 Alex Primavesi , Katherine Thompson

We introduce the notion of metric semilattice on the metric space and prove the criterion of $\R$-tree as connected geodesic metric space $X$ admitting the partial order, such that $X$ is semilinear metric semilattice. Also we state the…

Metric Geometry · Mathematics 2009-02-19 P. D. Andreev

A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer , H. Lakser

In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…

Logic · Mathematics 2026-01-27 Gianluca Paolini , Saharon Shelah

We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…

Logic in Computer Science · Computer Science 2026-04-30 Colin Riba , Adam Donadille

This work builds on the foundation laid by Gordon and Wilson in the study of isometry groups of solvmanifolds, i.e. Riemannian manifolds admitting a transitive solvable group of isometries. We restrict ourselves to a natural class of…

Differential Geometry · Mathematics 2015-11-03 Michael Jablonski

We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the…

Logic in Computer Science · Computer Science 2023-06-22 Tatsuji Kawai

Let $\mathcal{P}_s$ be the lattice of degrees of non-empty $\Pi_1^0$ subsets of $2^\omega$ under Medvedev reducibility. Binns and Simpson proved that $FD(\omega)$, the free distributive lattice on countably many generators, is…

Logic · Mathematics 2007-08-31 Joshua A. Cole

We investigate which definable separable metric spaces are countable dense homogeneous (CDH). We prove that a Borel CDH space is completely metrizable and give a complete list of zero-dimensional Borel CDH spaces. We also show that for a…

General Topology · Mathematics 2013-10-09 Michael Hrusak , Beatriz Zamora Aviles

We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…

Logic in Computer Science · Computer Science 2024-07-19 Tom de Jong

All spaces are assumed to be separable and metrizable. Ostrovsky showed that every zero-dimensional Borel space is $\sigma$-homogeneous. Inspired by this theorem, we obtain the following results: assuming $\mathsf{AD}$, every…

General Topology · Mathematics 2023-07-18 Andrea Medini , Zoltán Vidnyánszky

We study the space of ends of groups. For a finitely generated group, this is a Cantor space as soon as it is infinite. In contrast, we show that for infinitely generated countable groups, it exhibits several behaviors. For instance, we…

Group Theory · Mathematics 2019-07-03 Yves Cornulier

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

q-alg · Mathematics 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

Following Contou-Carrere [CC], we consider the Bott-Samelson resolution of a Schubert variety as a variety of galleries in the Tits building associated to the situation. We prove that the rational smoothness of a Schubert variety can be…

Algebraic Geometry · Mathematics 2016-09-07 Stéphane Gaussent

In this paper, we highlight some open problems stated by Xu and Zhao. In particular, we focus on strong $d$-spaces and answer two open problems concerning strong $d$-spaces. One is about the product space of an arbitrary family of strong…

General Topology · Mathematics 2021-09-24 Mengjie Jin , Hualin Miao , Qingguo Li

We solve the following three questions concerning surjective linear isometries between spaces of Lipschitz functions $\mathrm{Lip}(X,E)$ and $\mathrm{Lip}(Y,F)$, for strictly convex normed spaces $E$ and $F$ and metric spaces $X$ and $Y$:…

Functional Analysis · Mathematics 2010-09-29 Jesus Araujo , Luis Dubarbie

In the absence of the axiom of choice, new results concerning sequential, Fr\'echet-Urysohn, $k$-spaces, very $k$-spaces, Loeb and Cantor completely metrizable spaces are shown. New choice principles are introduced. Among many other…

General Topology · Mathematics 2021-08-04 Kyriakos Keremedis , Eliza Wajch

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

Logic · Mathematics 2025-12-12 Eike Neumann , Arno Pauly , Cécilia Pradic , Manlio Valenti