We provide an alternative proof of the theorem saying that any Vašák (or, weakly countably determined) Banach space admits a full -projectional skeleton. The proof is done with the use of the method of elementary submodels and is comparably simple as the proof given by W. Kubiś (2009) in case of weakly compactly generated spaces.
We study definable sets D of SU-rank 1 in , where ℳ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such D can be seen as a ’canonically embedded structure’, which inherits all relations on D which are definable in , and has no other definable relations. Our results imply that if no relation symbol of the language of ℳ has arity higher than 2, then there is a close relationship between triviality of dependence and being a reduct of a binary...
We compare two methods of proving separable reduction theorems in functional analysis - the method of rich families and the method of elementary submodels. We show that any result proved using rich families holds also when formulated with elementary submodels and the converse is true in spaces with fundamental minimal system and in spaces of density ℵ1. We do not know whether the converse is true in general. We apply our results to show that a projectional skeleton may be without loss of generality...
We simplify the presentation of the method of elementary submodels and we show that it can be used to simplify proofs of existing separable reduction theorems and to obtain new ones. Given a nonseparable Banach space X and either a subset A ⊂ X or a function f defined on X, we are able for certain properties to produce a separable subspace of X which determines whether A or f has the property in question. Such results are proved for properties of sets: of being dense, nowhere dense, meager, residual...