Related papers: Sequences with increasing subsequence
We introduce the Limiter, a universal extension of the real numbers and of the limit functional that assigns a canonical limit in an enlarged space to every real sequence. Motivated by generalized summation methods such as Borel summation…
We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $\lambda$ of countable confinality. Somewhat unexpectedly, the resulting theory is…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…
Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…
Let $\mathcal{I}$ be a meager ideal on $\mathbf{N}$. We show that if $x$ is a sequence with values in a separable metric space then the set of subsequences [resp. permutations] of $x$ which preserve the set of $\mathcal{I}$-cluster points…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
In this paper, we define a Banach SNL space to be a Banach space with a certain kind of linear map from it into its dual, and we develop the theory of linear $L$-positive subsets of Banach SNL spaces with Banach SNL dual spaces. We use this…
The Kestelman-Borwein-Ditor Theorem asserts that a non-negligible subset of $\mathbb{R}$ which is Baire (=has the Baire property, BP) or measurable is shift-compact: it contains some subsequence of any null sequence to within translation by…
The paper is the second of two and shows that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…
We study the analytic structure of the space of germs of an analytic function at the origin of \ww C^{\times m} , namely the space \germ{\mathbf{z}} where \mathbf{z}=\left(z\_{1},\cdots,z\_{m}\right) , equipped with a convenient locally…
Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…
We prove the following classification theorem of the ``Glimm -- Effros'' type for Borel order relations: a Borel partial order on the reals either is Borel linearizable or includes a copy of a certain Borel partial order $\meo$ which is not…
This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…
A model for statistical ranking is a family of probability distributions whose states are orderings of a fixed finite set of items. We represent the orderings as maximal chains in a graded poset. The most widely used ranking models are…
A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
Michalski gave a short and elegant proof of a theorem of A. Kumar which states that for each set A in R, there exists a subset B of A which is full in A and such that no distance between points in B is a rational number. He also proved a…