Related papers: The countable condensation on linear orders
In this survey we discuss work of Levin and V'yugin on collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. More precisely, Levin and V'yugin…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
Exactly solvable models of linear aggregation have been known since Ising's seminal one-dimensional model. This model is defined by a unique nearest-neighbour bond strength that is independent of the length of the cluster; known as…
In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion…
For each countable ordinal $\alpha$, we introduce an ideal $conv_\alpha$ and use it to characterize the class of all compact countable spaces which are homeomorphic to the space $\omega^{\alpha}\cdot n+1$ with the order topology. The…
Associated to a symmetric space there is a canonical connection with zero torsion and parallel curvature. This connection acts as a binary operator on the vector space of smooth sections of the tangent bundle, and it is linear with respect…
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…
We consider a separable compact line $K$ and its extension $L$ consisting of $K$ and a countable number of isolated points. The main object of study is the existence of a bounded extension operator $E: C(K)\to C(L)$. We show that if such an…
We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…
Let M be a space of homogeneous type and denote by F^\infty_{cont}(M) the space of finite linear combinations of continuous (1,\infty)-atoms. In this note we give a simple function theoretic proof of the equivalence on F^\infty_{cont}(M) of…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
Let G be a group and let O_G denote the set of left orderings on G. Then O_G can be topologized in a natural way, and we shall study this topology to show that O_G can never be countably infinite. This paper retrieves correct parts of the…
Assuming $\mathfrak b = \mathfrak c$ (or some weaker statement), we construct a compactification $\gamma\omega$ of $\omega$ such that its remainder $\gamma\omega\setminus\omega$ is nonseparable and carries a strictly positive measure.
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
We revisit the problem of condensation for independent, identically distributed random variables with a power-law tail, conditioned by the value of their sum. For large values of the sum, and for a large number of summands, a condensation…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…