ﻻ يوجد ملخص باللغة العربية
We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also prove that weak quasi-o-minimality of a theory with respect to one definable linear order implies weak quasi-o-minimality with respect to any other such order.
It is shown how tools from the area of Model Theory, specifically from the Theory of o-minimality, can be used to prove that a class of functions is VC-subgraph (in the sense of Dudley, 1987), and therefore satisfies a uniform polynomial metric entro
It is well-known that any finite $Pi^{0}_{1}$-class of $2^{mathbb N}$ has a computable member. Then, how can we understand this in the context of reverse mathematics? In this note, we consider several very weak fragments of KH{o}nigs lemma to answer this qeustion.
In this paper, we study minimality properties of partly modified mixed Tsirelson spaces. A Banach space with a normalized basis (e_k) is said to be subsequentially minimal if for every normalized block basis (x_k) of (e_k), there is a further block (
A Hausdorff topological group is called minimal if it does not admit a strictly coarser Hausdorff group topology. This paper mostly deals with the topological group $H_+(X)$ of order-preserving homeomorphisms of a compact linearly ordered connected s
We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations, namely the pr