Age-dependent decrease in glutamine synthetase expression in the hippocampal astroglia of the triple transgenic Alzheimer's disease mouse model : mechanism for deficient glutamatergic transmission?

Astrocytes are fundamental for brain homeostasis and the progression and outcome of many neuropathologies including Alzheimer's disease (AD). In the triple transgenic mouse model of AD (3xTg-AD) generalised hippocampal astroglia atrophy precedes a restricted and specific beta-amyloid (A beta) plaque-related astrogliosis. Astrocytes are critical for CNS glutamatergic transmission being the principal elements of glutamate homeostasis through maintaining its synthesis, uptake and turnover via glutamate-glutamine shuttle. Glutamine synthetase (GS), which is specifically expressed in astrocytes, forms glutamine by an ATP-dependent amination of glutamate. Here, we report changes in GS astrocytic expression in two major cognitive areas of the hippocampus (the dentate gyrus, DG and the CA1) in 3xTg-AD animals aged between 9 and 18 months. We found a significant reduction in Nv (number of cell/mm(3)) of GS immunoreactive (GS-IR) astrocytes starting from 12 months (28.59%) of age in the DG, and sustained at 18 months (31.65%). CA1 decrease of GS-positive astrocytes Nv (33.26%) occurs at 18 months. This Nv reduction of GSIR astrocytes is paralleled by a decrease in overall GS expression (determined by its optical density) that becomes significant at 18 months (21.61% and 19.68% in DG and CA1, respectively). GS-IR Nv changes are directly associated with the presence of A beta deposits showing a decrease of 47.92% as opposed to 23.47% in areas free of A beta. These changes in GS containing astrocytes and GS-immunoreactivity indicate AD-related impairments of glutamate homeostatic system, at the advanced and late stages of the disease, which may affect the efficacy of glutamatergic transmission in the diseased brain that may contribute to the cognitive deficiency.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Increase in the density of resting microglia precedes neuritic plaque formation and microglial activation in a transgenic model of Alzheimer's disease

The formation of cerebral senile plaques composed of amyloid beta peptide (A beta) is a fundamental feature of Alzheimer's disease (AD). Glial cells and more specifically microglia become reactive in the presence of A beta. In a triple transgenic model of AD (3 x Tg-AD), we found a significant increase in activated microglia at 12 (by 111%) and 18 (by 88%) months of age when compared with non-transgenic (non-Tg) controls. This microglial activation correlated with A beta plaque formation, and the activation in microglia was closely associated with A beta plaques and smaller A beta deposits. We also found a significant increase in the area density of resting microglia in 3 x Tg-AD animals both at plaque-free stage (at 9 months by 105%) and after the development of A plaques (at 12 months by 54% and at 18 months by 131%). Our results show for the first time that the increase in the density of resting microglia precedes both plaque formation and activation of microglia by extracellular A beta accumulation. We suggest that AD pathology triggers a complex microglial reaction: at the initial stages of the disease the number of resting microglia increases, as if in preparation for the ensuing activation in an attempt to fight the extracellular A beta load that is characteristic of the terminal stages of the disease. Cell Death and Disease (2010) 1, e1; doi:10.1038/cddis.2009.2; published online 14 January 2010

Self-Organized Criticality, Plasticity and Sensorimotor Coupling. Explorations with a Neurorobotic Model in a Behavioural Preference Task

During the last two decades, analysis of 1/f noise in cognitive science has led to a considerable progress in the way we understand the organization of our mental life. However, there is still a lack of specific models providing explanations of how 1/f noise is generated in coupled brain-body-environment systems, since existing models and experiments typically target either externally observable behaviour or isolated neuronal systems but do not address the interplay between neuronal mechanisms and sensorimotor dynamics. We present a conceptual model of a minimal neurorobotic agent solving a behavioural task that makes it possible to relate mechanistic (neurodynamic) and behavioural levels of description. The model consists of a simulated robot controlled by a network of Kuramoto oscillators with homeostatic plasticity and the ability to develop behavioural preferences mediated by sensorimotor patterns. With only three oscillators, this simple model displays self-organized criticality in the form of robust 1/f noise and a wide multifractal spectrum. We show that the emergence of self-organized criticality and 1/f noise in our model is the result of three simultaneous conditions: a) non-linear interaction dynamics capable of generating stable collective patterns, b) internal plastic mechanisms modulating the sensorimotor flows, and c) strong sensorimotor coupling with the environment that induces transient metastable neurodynamic regimes. We carry out a number of experiments to show that both synaptic plasticity and strong sensorimotor coupling play a necessary role, as constituents of self-organized criticality, in the generation of 1/f noise. The experiments also shown to be useful to test the robustness of 1/f scaling comparing the results of different techniques. We finally discuss the role of conceptual models as mediators between nomothetic and mechanistic models and how they can inform future experimental research where self-organized critically includes sensorimotor coupling among the essential interaction-dominant process giving rise to 1/f noise.