Related papers: The countable condensation on linear orders
Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…
We introduce a local order metric (LOM) that measures the degree of order in the neighborhood of an atomic or molecular site in a condensed medium. The LOM maximizes the overlap between the spatial distribution of sites belonging to that…
In this paper we show derivations among logarithmic space bounded counting classes based on closure properties of $\#L$ that leads us to the result that $NL=C_=L\subseteq PL$.
We find a natural $L_{\omega_1,\omega}$-axiomatisation $\Sigma$ of a structure on the upper half-plane $\mathbb{H}$ as the covering space of modular curves. The main theorem states that $\Sigma$ has a unique model in every uncountable…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
An arbitrary linear relation (multivalued operator) acting from one Hilbert space to another Hilbert space is shown to be the sum of a closable operator and a singular relation whose closure is the Cartesian product of closed subspaces.…
In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
We investigate dense lineability and spaceability of subsets of $\ell_\infty$ with a prescribed number of accumulation points. We prove that the set of all bounded sequences with exactly countably many accumulation points is densely…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
We review the condensation completion of a modular tensor category $\mathcal{C}$, which yields a fusion 2-category $\Sigma\mathcal{C}$ of separable algebras, bimodules over algebras and bimodule maps in $\mathcal{C}$. Physically,…
We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…
We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…
In this paper, we consider the linear direct sum of a real normed linear space with an order unit space and with a base normed space to obtain respectively a new order unit space and a new base normed space. As a consequence, we find that…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…