Putative neuroprotective compounds in in vitro models of dopaminergic neurodegeneration

Parkinson´s disease (PD) is a debilitating age-related neurological disorder that affects various motor skills and can lead to a loss of cognitive functions. The motor symptoms are the result of the progressive degeneration of dopaminergic neurons within the substantia nigra. The factors that influence the pathogenesis and the progression of the neurodegeneration remain mostly unclear. This study investigated the role of various programmed cell death (PCD) pathways, oxidative stress, and glial cells both in dopaminergic neurodegeneration and in the protective action of various drugs. To this end, we exposed dopaminergic neuroblastoma cells (SH-SY5Y cells) to 6-OHDA, which produces oxidative stress and activates various PCD modalities that result in neuronal degeneration. Additionally, to explore the role of glia, we prepared rat midbrain primary mixed-cell cultures containing both neurons and glial cell types such as microglia and astroglia and then exposed the cultures to either MPP plus or lipopolysaccharide. Our results revealed that 6-OHDA activated several PCD pathways including apoptosis, autophagic stress, lysosomal membrane permeabilization, and perhaps paraptosis in SH-SY5Y cells. Furthermore, we found that minocycline protected SH-SY5Y cells from 6-OHDA by inhibiting both apoptotic and non-apoptotic PCD modalities. We also observed an inconsistent neuroprotective effect of various dietary anti-oxidant compounds against 6-OHDA toxicity in vitro in SH-SY5Y cells. Specifically, quercetin and curcumin exerted neuroprotection only within a narrow concentration range and a limited time frame, whereas resveratrol and epigallocatechin 3-gallate provided no protection whatsoever. Lastly, we found that molecules such as amantadine may delay or even halt the neurodegeneration in primary cell cultures by inhibiting the release of neurotoxic factors from overactivated microglia and by enhancing the pro-survival actions of astroglia. Together these data suggest that the strategy of dampening oxidative species with anti-oxidants is less effective than preventing the production of toxic factors such as oxidative and pro-inflammatory molecules by pathologically activated microglia. This would subsequently prevent the activation of various PCD modalities that cause neuronal degeneration.

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

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.