Motivated by Tukey classification problems and building on work in Part 1 [5], we develop a new hierarchy of topological Ramsey spaces Rα, α < ω1. These spaces form a natural hierarchy of complexity, R0 being the Ellentuck space [7], and for each α < ω1, Rα+1 coming immediately after Rα in complexity. Associated with each Rα is an ultrafilter Uα, which is Ramsey for Rα, and in particular, is a ...

We show that for any infinite countable group G and for any free Borel action G y X there exists an equivariant class-bijective Borel map from X to the free part Free(2G) of the 2-shift G y 2G. This implies that any Borel structurability which holds for the equivalence relation generated by Gy Free(2G) must hold a fortiori for all equivalence relations coming from free Borel actions of G. A rel...

Each period an outcome (out of finitely many possibilities) is observed. For simplicity assume two possible outcomes, a and b. Each period, a forecaster announces the probability of a occurring next period based on the past. Consider an arbitrary subsequence of periods (e.g., odd periods, even periods, all periods in which b is observed, etc). Given an integer n, divide any such subsequence int...

We find necessary and sufficient conditions for a complete local (Noetherian) ring containing the rationals to be completion of countable excellent domain. Furthermore, we noncatenary domain, as well it unique factorization

We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of Borel reducibility. Following the approach of Louveau and Rosendal for the study of analytic equivalence relations, we study countable Borel qua...

A theory formulated in a countable predicate calculus can have at most 2א0 nonisomorphic countable models. In 1961 R. L. Vaught [9] conjected that if such a theory has uncountably many countable models, then it has exactly 2א0 countable models. This would of course follow immediately if one assumed the continuum hypothesis to be true. Almost ten years later, M. Morley [5] proved that if a count...

the minimal prime decomposition for semiprime ideals is defined and studied on z-ideals of c(x). the necessary and sufficient condition for existence of the minimal prime decomposition of a z-ideal / is given, when / satisfies one of the following conditions: (i) / is an intersection of maximal ideals. (ii) i is an intersection of o , s, when x is basically disconnected. (iii) i=o , when x x ha...

Abstract. A topological group H is called ω -narrow if for every neighbourhood V of it’s identity element there exists a countable set A such that V A = H = AV. A semigroup G is called a generalized group if for any x ∈ G there exists a unique element e(x) ∈ G such that xe(x) = e(x)x = x and for every x ∈ G there exists x − 1 ∈ G such that x − 1x = xx − 1 = e(x). Also le...

The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary prove theorems of ordinary mathematics, usually working in language second-order arithmetic L 2 . A major theme RM is therefore study structures that are countable or can be approximated by sets. Now, sets must represented sequences here, because higher-order definition ‘countable set’ involving injections/bij...