SYMMETRIC FINITE REPRESENTABILITY OF ℓp IN ORLICZ SPACES

It is well known that a Banach space need not contain any subspace isomorphic to a space ℓp (1 6 p ) or c0 (it was shown by Tsirelson in 1974). At the same time, by the famous Krivines theorem, every Banach space X always contains at least one of these spaces locally, i.e., there exist finite-dimensional subspaces of X of arbitrarily large dimension n which are isomorphic (uniformly) to ℓnp for some 1 6 p or cn0 . In thiscase one says that ℓp (resp. c0) is finitely representable in X. The main purpose of this paper is to give a characterization (with a complete proof) of the set of p such that ℓp is symmetrically finitely representable in a separable Orlicz space.

Finite representability of semigroups with demonic refinement

The motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.

COMPARING THE GENERALISED ROUNDNESS OF METRIC SPACES

Motivated by the local theory of Banach spaces, we introduce a notion of finite representability for metric spaces. This allows us to develop a new technique for comparing the generalised roundness of metric spaces. We illustrate this technique by applying it to Banach spaces and metric trees. In the realm of Banach spaces we obtain results such as the following: (1) if${\mathcal{U}}$is any ultrafilter and$X$is any Banach space, then the second dual$X^{\ast \ast }$and the ultrapower$(X)_{{\mathcal{U}}}$have the same generalised roundness as$X$, and (2) no Banach space of positive generalised roundness is uniformly homeomorphic to$c_{0}$or$\ell _{p}$,$2<p<\infty$. For metric trees, we give the first examples of metric trees of generalised roundness one that have finite diameter. In addition, we show that metric trees of generalised roundness one possess special Euclidean embedding properties that distinguish them from all other metric trees.

Undecidability of representability as binary relations

In this article we establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson's relation algebra. We also establish a number of undecidability results for representability as algebras of injective functions.