Playing Games on Sets and Models

The most prominent objective of the thesis is the development of the generalized descriptive set theory, as we call it. There, we study the space of all functions from a fixed uncountable cardinal to itself, or to a finite set of size two. These correspond to generalized notions of the universal Baire space (functions from natural numbers to themselves with the product topology) and the Cantor space (functions from natural numbers to the {0,1}-set) respectively. We generalize the notion of Borel sets in three different ways and study the corresponding Borel structures with the aims of generalizing classical theorems of descriptive set theory or providing counter examples. In particular we are interested in equivalence relations on these spaces and their Borel reducibility to each other. The last chapter shows, using game-theoretic techniques, that the order of Borel equivalence relations under Borel reduciblity has very high complexity. The techniques in the above described set theoretical side of the thesis include forcing, general topological notions such as meager sets and combinatorial games of infinite length. By coding uncountable models to functions, we are able to apply the understanding of the generalized descriptive set theory to the model theory of uncountable models. The links between the theorems of model theory (including Shelah's classification theory) and the theorems in pure set theory are provided using game theoretic techniques from Ehrenfeucht-Fraïssé games in model theory to cub-games in set theory. The bottom line of the research declairs that the descriptive (set theoretic) complexity of an isomorphism relation of a first-order definable model class goes in synch with the stability theoretical complexity of the corresponding first-order theory. The first chapter of the thesis has slightly different focus and is purely concerned with a certain modification of the well known Ehrenfeucht-Fraïssé games. There we (me and my supervisor Tapani Hyttinen) answer some natural questions about that game mainly concerning determinacy and its relation to the standard EF-game

Dependence of the large-scale vortex instability on latitude, stratification and domain size

In an earlier study, we reported on the excitation of large-scale vortices in Cartesian hydrodynamical convection models subject to rapid enough rotation. In that study, the conditions for the onset of the instability were investigated in terms of the Reynolds (Re) and Coriolis (Co) numbers in models located at the stellar North pole. In this study, we extend our investigation to varying domain sizes, increasing stratification, and place the box at different latitudes. The effect of the increasing box size is to increase the sizes of the generated structures, so that the principal vortex always fills roughly half of the computational domain. The instability becomes stronger in the sense that the temperature anomaly and change in the radial velocity are observed to be enhanced. The model with the smallest box size is found to be stable against the instability, suggesting that a sufficient scale separation between the convective eddies and the scale of the domain is required for the instability to work. The instability can be seen upto the colatitude of 30 degrees, above which value the flow becomes dominated by other types of mean flows. The instability can also be seen in a model with larger stratification. Unlike the weakly stratified cases, the temperature anomaly caused by the vortex structures is seen to depend on depth.

Finite-State Spell-Checking with Weighted Language and Error Models

In this paper we present simple methods for construction and evaluation of finite-state spell-checking tools using an existing finite-state lexical automaton, freely available finite-state tools and Internet corpora acquired from projects such as Wikipedia. As an example, we use a freely available open-source implementation of Finnish morphology, made with traditional finite-state morphology tools, and demonstrate rapid building of Northern Sámi and English spell checkers from tools and resources available from the Internet.