Dependences between definitions of finiteness
Using the general hypergraph technique developed in [7], we first give a much simpler proof of Shultz's theorem [10]: Each compact convex set is affinely homeomorphic to the state space of an orthomodular lattice. We also present partial solutions to open questions formulated in [10] - we show that not every compact convex set has to be a state space of a unital orthomodular lattice and that for unital orthomodular lattices the state space characterization can be obtained in the context of unital...
We prove that density preserving homeomorphisms form a Π11-complete subset in the Polish space ℍ of all increasing autohomeomorphisms of unit interval.
We study the descriptive set theoretical complexity of various randomness notions.
Let (ℝ) stand for the hyperspace of all nonempty compact sets on the real line and let d ±(x;E) denote the (right- or left-hand) Lebesgue density of a measurable set E ⊂ ℝ at a point x∈ ℝ. In [3] it was proved that is ⊓11-complete. In this paper we define an abstract density operator ⅅ± and we generalize the above result. Some applications are included.
We prove a game-theoretic dichotomy for sets of block sequences in vector spaces that extends, on the one hand, the block Ramsey theorem of W. T. Gowers proved for analytic sets of block sequences and, on the other hand, M. Davis’ proof of Σ⁰₃ determinacy.