Spectra of Tukey types of ultrafilters on Boolean algebras

Extending recent investigations on the structure of Tukey types of ultrafilters on $\mathcal{P}(\omega)$ to Boolean algebras in general, we classify the spectra of Tukey types of ultrafilters for several classes of Boolean algebras, including interval algebras, tree algebras, and pseudo-tree algebras.Comment: 18 page

On constructions with 22-cardinals

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman's neat simplified morasses called $2$-cardinals. The theory of related trees, gaps, colorings of pairs and forcing notions is reformulated and sketched from a unifying point of view with the focus on the applicability to constructions of mathematical structures like Boolean algebras, Banach spaces or compact spaces. A new result which we obtain as a side product is the consistency of the existence of a function $f:[\lambda^{++}]^2\rightarrow[\lambda^{++}]^{\leq\lambda}$ with the appropriate $\lambda^+$-version of property $\Delta$ for regular $\lambda\geq\omega$ satisfying $\lambda^{<\lambda}=\lambda$.Comment: Minor correction

Classification from a computable viewpoint

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence, in terms of relatively simple invariants. Where this is impossible, it is useful to have concrete results saying so. In model theory and descriptive set theory, there is a large body of work showing that certain classes of mathematical structures admit classification while others do not. In the present paper, we describe some recent work on classification in computable structure theory. Section 1 gives some background from model theory and descriptive set theory. From model theory, we give sample structure and non-structure theorems for classes that include structures of arbitrary cardinality. We also describe the notion of Scott rank, which is useful in the more restricted setting of countable structures. From descriptive set theory, we describe the basic Polish space of structures for a fixed countable language with fixed countable universe. We give sample structure and non-structure theorems based on the complexity of the isomorphism relation, and on Borel embeddings. Section 2 gives some background on computable structures. We describe three approaches to classification for these structures. The approaches are all equivalent. However, one approach, which involves calculating the complexity of the isomorphism relation, has turned out to be more productive than the others. Section 3 describes results on the isomorphism relation for a number of mathematically interesting classes—various kinds of groups and fields. In Section 4, we consider a setting similar to that in descriptive set theory. We describe an effective analogue of Borel embedding which allows us to make distinctions even among classes of finite structures. Section 5 gives results on computable structures of high Scott rank. Some of these results make use of computable embeddings. Finally, in Section 6, we mention some open problems and possible directions for future work

Vietoris hyperspaces of scattered Priestley spaces

We study Vietoris hyperspaces of closed and closed final sets of Priestley spaces. We are particularly interested in Skula topologies. A topological space is \emph{Skula} if its topology is generated by differences of open sets of another topology. A compact Skula space is scattered and moreover has a natural well-founded ordering compatible with the topology, namely, it is a Priestley space. One of our main objectives is investigating Vietoris hyperspaces of general Priestley spaces, addressing the question when their topologies are Skula and computing the associated ordinal ranks. We apply our results to scattered compact spaces based on certain almost disjoint families, in particular, Lusin families and ladder systems.Comment: Minor corrections, added some comments. Final version (30 pages