Related papers: Uncountable strongly surjective linear orders

We prove that it is relatively consistent with $\mathrm{ZFC}$ that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel's conjecture fails). This answers a…

We prove that $\mu=\mu^{<\mu}$, $2^\mu=\mu^+$ and ``there is a non reflecting stationary subset of $\mu^+$ composed of ordinals of cofinality $<\mu$'' imply that there is a $\mu$-complete Souslin tree on $\mu^+$.

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner $k$-system (for $k \geq 2$) is a linear space such that each line has size exactly $k$. Clearly, as a two-sorted structure,…

The purpose of this article is to give new constructions of linear orders which are minimal with respect to being non-$\sigma$-scattered. Specifically, we will show that Jensen's principle $\diamondsuit$ implies that there is a minimal…

A forcing poset of size 2^{2^{aleph_1}} which adds no new reals is described and shown to provide a Delta^2_2 definable well-order of the reals (in fact, any given relation of the reals may be so encoded in some generic extension). The…

This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…

For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…

We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…

We analyse the complexity of the class of (special) Aronszajn, Suslin and Kurepa trees in the projective hierarchy of the higher Baire-space $\omega_1^{\omega_1}$. First, we will show that none of these classes have the Baire property…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…

In this paper, we prove that a pseudoexponential field has continuum many non-isomorphic countable real closed exponential subfields, each with an order preserving exponential map which is surjective onto the nonnegative elements. Indeed,…

A topological space $X$ is strongly $D$ if for any neighbourhood assignment $\{U_x:x\in X\}$, there is a $D\subseteq X$ such that $\{U_x:x\in D\}$ covers $X$ and $D$ is locally finite in the topology generated by $\{U_x:x\in X\}$. We prove…

We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…

Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$ and asked whether this bound is sharp,…

For uncountable downwards closed subtrees $U$ and $W$ of an $\omega_1$-tree $T$, we say that $U$ and $W$ are strongly almost disjoint if their intersection is a finite union of countable chains. The tree $T$ is strongly non-saturated if…