6 resultados para whether sufficient element of compromise
Resumo:
353 págs.
Resumo:
We present two experiments designed to investigate whether individuals’ notions of distributive justice are associated with their relative (within-society) economic status. Each participant played a specially designed four-person dictator game under one of two treatments, under one initial endowments were earned, under the other they were randomly assigned. The first experiment was conducted in Oxford, United Kingdom, the second in Cape Town, South Africa. In both locations we found that relatively well-off individuals make allocations to others that reflect those others’ initial endowments more when those endowments were earned rather than random; among relatively poor individuals this was not the case.
Resumo:
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.
Resumo:
[EN] Neurodegeneration together with a reduction in neurogenesis are cardinal features of Alzheimer’s disease (AD) induced by a combination of toxic amyloid-β peptide (Aβ) and a loss of trophic factor support. Amelioration of these was assessed with diverse neurotrophins in experimental therapeutic approaches. The aim of this study was to investigate whether intranasal delivery of plasma rich in growth factors (PRGF-Endoret), an autologous pool of morphogens and proteins, could enhance hippocampal neurogenesis and reduce neurodegeneration in an amyloid precursor protein/presenilin-1 (APP/PS1) mouse model. Neurotrophic and neuroprotective actions were firstly evident in primary neuronal cultures, where cell proliferation and survival were augmented by Endoret treatment. Translation of these effects in vivo was assessed in wild type and APP/PS1 mice, where neurogenesis was evaluated using 5-bromodeoxyuridine (BdrU), doublecortin (DCX), and NeuN immunostaining 5 weeks after Endoret administration. The number of BrdU, DCX, and NeuN positive cell was increased after chronic treatment. The number of degenerating neurons, detected with fluoro Jade-B staining was reduced in Endoret-treated APP/PS1 mice at 5 week after intranasal administration. In conclusion, Endoret was able to activate neuronal progenitor cells, enhancing hippocampal neurogenesis, and to reduce Aβ-induced neurodegeneration in a mouse model of AD.
Resumo:
This paper investigates the errors of the solutions as well as the shadowing property of a class of nonlinear differential equations which possess unique solutions on a certain interval for any admissible initial condition. The class of differential equations is assumed to be approximated by well-posed truncated Taylor series expansions up to a certain order obtained about certain, in general nonperiodic, sampling points t(i) is an element of [t(0), t(J)] for i = 0, 1, . . . , J of the solution. Two examples are provided.
Resumo:
Under the guidance of Ramon y Cajal, a plethora of students flourished and began to apply his silver impregnation methods to study brain cells other than neurons: the neuroglia. In the first decades of the twentieth century, Nicolas Achucarro was one of the first researchers to visualize the brain cells with phagocytic capacity that we know today as microglia. Later, his pupil Pio del Rio-Hortega developed modifications of Achucarro's methods and was able to specifically observe the fine morphological intricacies of microglia. These findings contradicted Cajal's own views on cells that he thought belonged to the same class as oligodendroglia (the so called "third element" of the nervous system), leading to a long-standing discussion. It was only in 1924 that Rio-Hortega's observations prevailed worldwide, thus recognizing microglia as a unique cell type. This late landing in the Neuroscience arena still has repercussions in the twenty first century, as microglia remain one of the least understood cell populations of the healthy brain. For decades, microglia in normal, physiological conditions in the adult brain were considered to be merely "resting," and their contribution as "activated" cells to the neuroinflammatory response in pathological conditions mostly detrimental. It was not until microglia were imaged in real time in the intact brain using two-photon in vivo imaging that the extreme motility of their fine processes was revealed. These findings led to a conceptual revolution in the field: "resting" microglia are constantly surveying the brain parenchyma in normal physiological conditions. Today, following Cajal's school of thought, structural and functional investigations of microglial morphology, dynamics, and relationships with neurons and other glial cells are experiencing a renaissance and we stand at the brink of discovering new roles for these unique immune cells in the healthy brain, an essential step to understand their causal relationship to diseases.