The COVID-19 pandemic has presented a global threat to physical and mental health worldwide. Research has highlighted adverse impacts of COVID-19 on wellbeing but has yet to offer insights as to how wellbeing may be protected. Inspired by developments in wellbeing science and guided by our own theoretical framework, we examined the role of various potentially protective factors in a sample of 138 participants from the United Kingdom. Protective factors included physical activity, tragic optimism, gratitude, social support, and nature connectedness. (...) Initial analysis involved the application of one-sample t-tests, which confirmed that wellbeing in the current sample was significantly lower compared to previous samples. Protective factors were observed to account for up to 50% of variance in wellbeing in a hierarchical linear regression that controlled for a range of sociostructural factors including age, gender, and subjective social status, which impact on wellbeing but lie beyond individual control. Gratitude and tragic optimism emerged as significant contributors to the model. Our results identify key psychological attributes that may be harnessed through various positive psychology strategies to mitigate the adverse impacts of hardship and suffering, consistent with an existential positive psychology of suffering. (shrink)

Bilingualism has been identified as a potential cognitive factor linked to delayed onset of dementia as well as boosting executive functions in healthy individuals. However, more recently, this claim has been called into question following several failed replications. It remains unclear whether these contradictory findings reflect how bilingualism is defined between studies, or methodological limitations when measuring the bilingual effect. One key issue is that despite the claims that bilingualism yields general protection to cognitive processes, studies reporting putative bilingual differences (...) are often focused on domain specific experimental paradigms. This study chose a broader approach, by considering the consequences of bilingualism on a wide range of cognitive functions within individuals. We utilised 19 measures of different cognitive functions commonly associated with bilingual effects, to form a “cognitive profile” for 215 non-clinical participants. We recruited Welsh speakers, who as a group of bilinguals were highly homogeneous, as means of isolating the bilingualism criterion. We sought to determine if such analyses would independently classify bilingual/monolingual participant groups based on emergent patterns driven by collected cognitive profiles, such that population differences would emerge. Multiple predictive models were trained to independently recognise the cognitive profiles of bilinguals, older adults and higher education attainment. Despite managing to successfully classify cognitive profiles based on age and education, the model failed to differentiate between bilingual and monolingual cognitive ability at a rate greater than that of chance. Repeated modelling using alternative definitions of bilingualism, and just the older adults, yielded similar results. In all cases then, using our “bottom–up” analytical approach, there was no evidence that bilingualism as a variable indicated differential cognitive performance – as a consequence, we conclude that bilinguals are not cognitively different from their monolingual counterparts, even in older demographics. We suggest that studies that have reported a bilingual advantage could well have confounded other key variables that may be driving reported advantages. We recommend that future research refine the machine learning methods used in this study to further investigate the complex relationship between bilingualism and cognition. (shrink)

Imagine a model of the universe that, if true and known to be true, would solve the following philosophical problems: the direction and flow of time, an ontology for laws of nature, the interpretation of quantum mechanics, the interpretation of probability, a semantics for counterfactuals, trans-world and trans-temporal identity, essentialism and natural kinds, and free will and responsibility. The successful solution to these problems would convince most of us that we should, at the very least, give this model (...) serious consideration. This is the argument of Storrs McCall's A Model of the Universe: Space-Time, Probability, and Decision. Assume that the branched-tree model of the universe is true, and all these problems are solved. Thus, the branched-tree model should at least be a plausible candidate for the true model of the universe. (shrink)

We prove that every infinite rooted narrow tree Kripke model of HA is locally PA.

We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the (...) literature are indeed [Formula: see text]. (shrink)

We consider ω n -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length ω n for some integer n ≥ 1. We show that all these structures are ω-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for ω 2 -automatic (resp. ω n -automatic for n > 2) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) (...) is not determined by the axiomatic system ZFC. We infer from the proof of the above result that the isomorphism problem for ω n -automatic boolean algebras, n ≥ 2, (respectively, rings, commutative rings, non commutative rings, non commutative groups) is neither a ${\mathrm{\Sigma }}_{2}^{1}-\mathrm{s}\mathrm{e}\mathrm{t}$ nor a ${\mathrm{\Pi }}_{2}^{1}-\mathrm{s}\mathrm{e}\mathrm{t}$ . We obtain that there exist infinitely many ω n -automatic, hence also ω-tree-automatic, atomless boolean algebras $\mathcal{B}_{n}$ , n ≥ 1, which are pairwise isomorphic under the continuum hypothesis CH and pairwise non isomorphic under an alternate axiom AT, strengthening a result of [14]. (shrink)

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional (...) yield of an MSO-definable three-dimensional tree language. (shrink)

Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a quantifiable manner in the current (...) methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

Let κ be a singular cardinal. Karp's notion of a chain model of size κ is defined to be an ordinary model of size κ along with a decomposition of it into an increasing union of length cf. With a notion of satisfaction and -isomorphism such models give an infinitary logic largely mimicking first order logic. In this paper we associate to this logic a notion of a dynamic EF-game which gauges when two chain models are chain-isomorphic. To (...) this game is associated a tree which is a tree of size κ with no κ-branches -branches). The measure of how non-isomorphic the models are is reflected by a certain order on these trees, called reduction. We study the collection of trees of size κ with no κ-branches under this notion and prove that when cf = ω this collection is rather regular; in particular it has universality number exactly κ+. Such trees are then used to develop a descriptive set theory of the space cf κ. The main result of the paper gives in the case of κ strong limit singular an exact connection between the descriptive set-theoretic complexity of the chain isomorphism orbit of a model, the reduction order on the trees and winning strategies in the corresponding dynamic EF games. In particular we obtain a neat analog of the notion of Scott watershed from the Scott analysis of countable models. (shrink)

We propose a model of natural language inference which identifies valid inferences by their lexical and syntactic features, without full semantic interpretation. We extend past work in natural logic, which has focused on semantic containment and monotonicity, by incorporating both semantic exclusion and implicativity. Our model decomposes an inference problem into a sequence of atomic edits linking premise to hypothesis; predicts a lexical semantic relation for each edit; propagates these relations upward through a semantic composition tree according (...) to properties of intermediate nodes; and joins the resulting semantic relations across the edit sequence. A computational implementation of the model achieves 70% accuracy and 89% precision on the FraCaS test suite. Moreover, including this model as a component in an existing system yields significant performance gains on the Recognizing Textual Entailment challenge. (shrink)

In this article the structure of the models of decidable monadic theories of planar graphs is investigated. It is shown that if the monadic theory of a class K of planar graphs is decidable, then the tree-width in the sense of Robertson and Seymour of the elements of K is universally bounded and there is a class T of trees such that the monadic theory of K is interpretable in the monadic theory of T.

A model of ZFC is constructed in which the distributivity cardinal h is 2 ℵ 0 = ℵ 2 , and in which there are no ω 2 -towers in [ω] ω . As an immediate corollary, it follows that any base-matrix tree in this model has no cofinal branches. The model is constructed via a form of iterated Mathias forcing, in which a mixture of finite and countable supports is used.

How is scientific knowledge used, adapted, and extended in deriving phenomena and real-world systems? This paper aims at developing a general account of 'applying science' within the exemplar-based framework of Data-Oriented Processing (DOP), which is also known as Exemplar-Based Explanation (EBE). According to the exemplar-based paradigm, phenomena are explained not by deriving them all the way down from theoretical laws and boundary conditions but by modelling them on previously derived phenomena that function as exemplars. To accomplish this, DOP proposes to (...) maintain a corpus of derivation trees of previous phenomena together with a matching algorithm that combines subtrees from the corpus to derive new phenomena. By using a notion of derivational similarity, a new phenomenon can be modelled as closely as possible on previously explained phenomena. I will propose an instantiation of DOP which integrates theoretical and phenomenological modelling and which generalises over various disciplines, from fluid mechanics to language technology. I argue that DOP provides a solution for what I call Kuhn's problem and that it redresses Kitcher's account of explanation. (shrink)

A model M = (M, E,...) of Zermelo-Fraenkel set theory ZF is said to be θ-like, where E interprets ∈ and θ is an uncountable cardinal, if |M| = θ but $|\{b \in M: bEa\}| for each a ∈ M. An immediate corollary of the classical theorem of Keisler and Morley on elementary end extensions of models of set theory is that every consistent extension of ZF has an ℵ 1 -like model. Coupled with Chang's two cardinal theorem (...) this implies that if θ is a regular cardinal θ such that $2^{ then every consistent extension of ZF also has a θ + -like model. In particular, in the presence of the continuum hypothesis every consistent extension of ZF has an ℵ 2 -like model. Here we prove: THEOREM A. If θ has the tree property then the following are equivalent for any completion T of ZFC: (i) T has a θ-like model. (ii) $\Phi \subseteq T$ , where Φ is the recursive set of axioms {∃ κ(κ is n-Mahlo and "V κ is a Σ n -elementary submodel of the universe"): n ∈ ω}. (iii) T has a λ-like model for every uncountable cardinal λ. THEOREM B. The following are equiconsistent over ZFC: (i) "There exists an ω-Mahlo cardinal". (ii) "For every finite language L, all ℵ 2 -like models of ZFC(L) satisfy the scheme Φ(L). (shrink)

We apply an algorithmic learning model of inquiry to model reasoning carried by experimental subjects in Wason's _Selection Task_ that represents reasoning in the task as computation of a decision tree that supervenes on semantic representations. We argue that the resulting model improves on previous probabilistic and pragmatic models of the task. In particular, it suggests that subjects' selection could in fact be guided by sophisticated patterns of argumentative reasoning.

Let U and B be two countable relational models of the same first order language. If the models are nonisomorphic, there is a unique countable ordinal α with the property that $\mathfrak{U} \equiv^\alpha_{\infty\omega} \mathfrak{B} \text{but not} \mathfrak{U} \equiv^{\alpha + 1}_{\infty\omega} \mathfrak{B},$ i.e. U and B are L ∞ω -equivalent up to quantifier-rank α but not up to α + 1. In this paper we consider models U and B of cardinality ω 1 and construct trees which have a similar relation (...) to U and B as α above. For this purpose we introduce a new ordering T ≪ T' of trees, which may have some independent interest of its own. It turns out that the above ordinal α has two qualities which coincide in countable models but will differ in uncountable models. Respectively, two kinds of trees emerge from α. We call them Scott trees and Karp trees, respectively. The definition and existence of these trees is based on an examination of the Ehrenfeucht game of length ω 1 between U and B. We construct two models of power ω 1 with 2 ω 1 mutually noncomparable Scott trees. (shrink)

While rules and exemplars are usually viewed as opposites, this paper argues that they form end points of the same distribution. By representing both rules and exemplars as (partial) trees, we can take into account the fluid middle ground between the two extremes. This insight is the starting point for a new theory of language learning that is based on the following idea: If a language learner does not know which phrase‐structure trees should be assigned to initial sentences, s/he allows (...) (implicitly) for all possible trees and lets linguistic experience decide which is the “best” tree for each sentence. The best tree is obtained by maximizing “structural analogy” between a sentence and previous sentences, which is formalized by the most probable shortest combination of subtrees from all trees of previous sentences. Corpus‐based experiments with this model on the Penn Treebank and the Childes database indicate that it can learn both exemplar‐based and rule‐based aspects of language, ranging from phrasal verbs to auxiliary fronting. By having learned the syntactic structures of sentences, we have also learned the grammar implicit in these structures, which can in turn be used to produce new sentences. We show that our model mimicks children’s language development from item‐based constructions to abstract constructions, and that the model can simulate some of the errors made by children in producing complex questions. (shrink)

ABSTRACT Many temporal and modal logic languages can be regarded as subsets of first order logic, i.e. the semantics of a temporal logic formula is given as a first order condition on points of the underlying models (Kripke structures). Often the set of possible models is restricted to models which are trees. A temporal logic language is (first order) expressively complete, if for every first order condition for a node of a tree there exists an equivalent temporal formula which (...) expresses the same condition. In this paper expressive completeness of the temporal logic language with the set of operators U (until), S (since), and X k (k-next) is proved, and the result is extended to various other tree-like structures. (shrink)

Multicast can improve network performance by eliminating unnecessary duplicated flows in the data center networks. Thus it can significantly save network bandwidth. However, the network multicast blocking may cause the retransmission of a large number of data packets and seriously influence the traffic efficiency in data center networks, especially in the fat-tree DCNs with multirooted tree structure. In this paper, we build a multicast blocking model and apply it to solve the problem of network blocking in the (...) fat-tree DCNs. Furthermore, we propose a novel multicast scheduling strategy. In the scheduling strategy, we select the uplink connecting to available core switch whose remaining bandwidth is close to and greater than the three times of bandwidth multicast requests so as to reduce the operation time of the proposed algorithm. Then the blocking probability of downlink in the next time-slot is calculated in multicast subnetwork by using Markov chains theory. With the obtained probability, we select the optimal downlink based on the available core switch. In addition, theoretical analysis shows that the multicast scheduling algorithm has close to zero network blocking probability as well as lower time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm. (shrink)

The discourse marker use of the word like is considered by many to be superfluously sprinkled into talk, a bad habit best avoided. But a comparison of the use of like in successive tellings of stories demonstrates that like can be anticipated in advance and planned into stories. In this way, like is similar to other words and phrases tellers recycle during story telling. The anticipation of like contrasted with the uses of other discourse markers such as oh, you know, (...) and well, which almost never re-occurred in similar locations across tellings. Um and uh did sometimes re-occur; these uses are contrasted with like. Although discourse markers are generally used on the fly to handle various issues that come up in coordinating talk as it unfolds, like can be used as an integral part of the story -a marked contrast to the prevalent idea that likes are speech tics. (shrink)

Words like well, oh, and you know have long been observed and studied in spontaneous speech. With the proliferation of on-line dialogues, such as instant messaging between friends or back-and-forth postings at websites, there are increasing opportunities to observe them in spontaneous writing. In Experiment 1, the interpretation of discourse markers in on-line debates was compared to proposed functions of those markers identified in other settings. In Experiment 2, the use of discourse markers in spontaneous speech was compared to their (...) uses in spontaneous writing. Results support the conclusion that although they vary in frequency in spoken versus written domains, discourse markers are used similarly across domains, but with particular communicative functions that make them non-interchangeable. (shrink)

To generate empathy in the care of vulnerable older persons requires care providers to reflect critically on their care practices. Ethics education and training must provide them with tools to accomplish such critical reflection. It must also create a pedagogical context in which good care can be taught and cultivated. The care-ethics lab ‘sTimul’ originated in 2008 in Flanders with the stimulation of ethical reflection in care providers and care providers in training as its main goal. Also in 2008, sTimul (...) commenced the organization of empathy sessions as an attempt to achieve this goal by simulation. The empathy session is a practical and fairly straightforward way of working to provoke care providers and care providers in training to engage in ethical reflection. Characteristic of the empathy session in the care-ethics lab is the emphasis on experience as a basis for ethical reflection. (shrink)

Assuming some large cardinals, a model of ZFC is obtained in which $\aleph_{\omega+1}$ carries no Aronszajn trees. It is also shown that if $\lambda$ is a singular limit of strongly compact cardinals, then $\lambda^+$ carries no Aronszajn trees.

The paper starts with the research on the early discovery of college students' psychological problems. Besides, it analyzes the data of the general survey of college students' mental health in a certain university, the existing data of students with psychological problems, and the questionnaire data of students' basic information in school. By comprehensively using the decision tree model and Kendall correlation analysis and other methods, using Python and SPSS software to preprocess the data and realize the model, (...) it can obtain a psychological problem prediction model based on the objective behavior data of college students. The model is actually analyzed, and it gets good results. (shrink)

We show that if κ is a weakly compact cardinal then the embeddability relation on trees of size κ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space View the MathML source there is an Lκ+κ-sentence φ such that the embeddability relation on its models of size κ, which are all trees, is Borel bi-reducible to R. In particular, this implies that the relation of embeddability on trees of size κ is complete for (...) analytic quasi-orders on View the MathML source. These facts generalize analogous results for κ=ω obtained in Louveau and Rosendal [17] and Friedman and Motto Ros [6], and it also partially extends a result from Baumgartner [3] concerning the structure of the embeddability relation on linear orders of size κ. (shrink)

We explored the differential impact of auditory information and written contextual information on the recognition of verbal irony in spontaneous speech. Based on relevance theory, we predicted that speakers would provide acoustic disambiguation cues when speaking in situations that lack other sources of information, such as a visual channel. We further predicted that listeners would use this information, in addition to context, when interpreting the utterances. People were presented with spontaneously produced ironic and nonironic utterances from radio talk shows in (...) written or auditory form, with or without written contextual information. When the utterances were read without written contextual information, all utterances were rated as equally ironic. But when they were heard as opposed to read, or when they were presented in irony-biasing contexts, originally ironic utterances were rated as more sarcastic than originally nonironic utterances. This evidence suggests both acoustic and contextual information are used when inferring ironic intent in spontaneous speech, and validates previous manipulations of intonation in studies of irony understanding. (shrink)

This paper studies the relation between some extensions of the non-associative Lambek Calculus NL and their interpretation in tree models (free groupoids). We give various examples of sequents that are valid in tree models, but not derivable in NL. We argue why tree models may not be axiomatizable if we add finitely many derivation rules to NL, and proceed to consider labeled calculi instead.We define two labeled categorial calculi, and prove soundness and completeness for interpretations that are (...) almost the intended one, namely for tree models where some branches of some trees may be resp. all branches of all trees must be infinitely extending. Extrapolating from the experiences in our quite simple systems, we briefly discuss some problems involved with the introduction of labels in categorial grammar, and argue that many of the basic questions are not yet understood. (shrink)

Let $T$ be a theory in a countable fragment of $\mathcal{L}_{\omega_{1},\omega}$ whose extensions in countable fragments have only countably many types. Sacks proves a bounding theorem that generates models of high Scott rank. For this theorem, a tree hierarchy is developed for $T$ that enumerates these extensions. In this paper, we effectively construct a predecessor function for formulas defining types in this tree hierarchy as follows. Let $T_{\gamma}\subseteq T_{\delta}$ with $T_{\gamma}$- and $T_{\delta}$-theories on level $\gamma$ and $\delta$, respectively. (...) Then if $\ulcorner p\urcorner $ is a formula that defines a type for $T_{\delta}$, our predecessor function provides a formula for defining its subtype in $T_{\gamma}$. By constructing this predecessor function, we weaken an assumption for Sacks’s result. (shrink)

The tense tree method extends Jeffrey’s well-known formulation of classical propositional logic to tense logic (Jeffrey 1991).1 Tense trees combine pure tense logic with features of Prior’s U-calculi (where ‘U’ is the earlier-than relation; see Prior 1967 and the Introduction to this volume). The tree method has a number of virtues: trees are well suited to computational applications; semantically, the tree systems presented here are no less illuminating than model theory; the metatheory associated with tree (...) formulations is often more tractable than that required in a model-theoretic setting; and last but not least the tree method is ideal for pedagogical purposes. (shrink)

From large cardinals we obtain the consistency of the existence of a singular cardinal κ of cofinality ω at which the Singular Cardinals Hypothesis fails, there is a bad scale at κ and κ ++ has the tree property. In particular this model has no special κ +-trees.

The canonical view of a 3‐domain (3D) tree of life was recently challenged by the discovery of Asgardarchaeota encoding eukaryote signature proteins (ESPs), which were treated as missing links of a 2‐domain (2D) tree. Here we revisit the debate. We discuss methodological limitations of building trees with alignment‐dependent approaches, which often fail to satisfactorily address the problem of ‘‘gaps.’’ In addition, most phylogenies are reconstructed unrooted, neglecting the power of direct rooting methods. Alignment‐free methodologies lift most difficulties but (...) require employing realistic evolutionary models. We argue that the discoveries of Asgards and ESPs, by themselves, do not rule out the 3D tree, which is strongly supported by comparative and evolutionary genomic analyses and vast genomic and biochemical superkingdom distinctions. Given uncertainties of retrodiction and interpretation difficulties, we conclude that the 3D view has not been falsified but instead has been strengthened by genomic analyses. In turn, the objections to the 2D model have not been lifted. The debate remains open. Also see the video abstract here: https://youtu.be/-6TBN0bubI8. (shrink)

Observing others in conversation is a common format for comprehending language, yet little work has been done to understand dialog comprehension. We tested whether overhearers use addressee backchannels as predictive cues for how to integrate information across speaker turns during comprehension of spontaneously produced collaborative narration. In Experiment 1, words that followed specific backchannels were recognized more slowly than words that followed either generic backchannels or pauses. In Experiment 2, we found that when the turn after the backchannel was a (...) continuation of the narrative, specific backchannels prompted the fastest verification of prior information. When the turn after was an elaboration, they prompted the slowest, indicating that overhearers took specific backchannels as cues to integrate preceding talk with subsequent talk. These findings demonstrate that overhearers capitalize on the predictive relationship between backchannels and the development of speakers’ talk, coordinating information across conversational roles. (shrink)

Gelfond and Lifschitz proposed the notion of a stable model of a logic program. We establish that the set of all stable models in a Herbrand universe of a recursive logic program is, up to recursive renaming, the set of all infinite paths of a recursive, countably branching tree, and conversely. As a consequence, the problem, given a recursive logic program, of determining whether it has at least one stable model, is Σ11-complete. Due to the equivalences established (...) in the authors' previous nonmonotone rule systems papers ), this applies equally to truth maintenance systems and default logics. (shrink)

We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $\kappa $, updating some classical constructions in the process. This includes models of $\mathsf {CSR}(\kappa ^{++})\wedge {\sf TP}(\kappa ^{++})$ (both with and without ${\sf AP}(\kappa ^{++})$ ) and models of the conjunctions ${\sf SR}(\kappa ^{++}) \wedge \mathsf {wTP}(\kappa ^{++}) \wedge {\sf AP}(\kappa ^{++})$ and $\neg {\sf AP}(\kappa ^{++}) \wedge {\sf SR}(\kappa ^{++})$ (the latter was originally obtained in joint work by Krueger and (...) the first author [9], and is here given using different methods). Analogs of these results with the failure of $\sf {SH}(\kappa ^{++})$ are given as well. Finally, we obtain all of our results with an arbitrarily large $2^\kappa $, applying recent joint work by Honzik and the third author. (shrink)

The study of decision making has traditionally been dominated by axiomatic utility theories. More recently, an alternative approach, which focuses on the micro-mechanisms of the underlying deliberation process, has been shown to account for several "paradoxes" in human choice behavior for which simple utility-based approaches cannot. Decision field theory (DFT) is a cognitive-dynamical model of decision making and preferential choice, built on the fundamental principle that decisions are based on the accumulation of subjective evaluations of choice alternatives until a (...) threshold criterion is met. This article extends the basic DFT framework to the domain of dynamic decision making. DFT-Dynamic is proposed as a new alternative to normative backward induction. Through its attention to the processes underlying planning and deliberation DFT-D provides simple, emergent explanations for violations of choice principles traditionally taken as evidence of irrationality. A recent multistage decision making study is used to showcase the model's efficacy for developing cognitive models of individual strategies. (shrink)

All animals have evolved solutions to manage their genomes, enabling the efficient organization of meters of DNA strands in the nucleus and allowing for nuanced regulation of gene expression while keeping transposable elements suppressed. Epigenetic modifications are central to accomplishing all these. Recent advances in sequencing technologies and the development of techniques that profile epigenetic marks and chromatin accessibility using reagents that can be used in any species has catapulted epigenomic studies in diverse animal species, shedding light on the multitude (...) of epigenomic mechanisms utilized across the evolutionary tree. Now, comparative epigenomics is a rapidly growing field that is uncovering mechanistic aspects of epigenetic modifications and chromatin organization in non‐model invertebrates, ranging from octopus to sponges. This review puts recent discoveries in the epigenetics of non‐model invertebrates in historical context, and describes new insight into the patterning and functions of DNA methylation and other highly conserved epigenetic modifications. (shrink)

This article engages through an interdisciplinary approach to re-envision Tangintebu Theological College’s (TTC) model of theological education in the context of climate change in Kiribati. It utilises the anthropological theory of symbolic interactionism within missiological, cultural and, theological studies of climate change. It argues for the coconut tree as an appropriate cultural conceptual metaphorical idiom for translating and understanding Christian faith and shaping a theological pedagogy within the Kiribati context of climate change. The coconut image is an indigenous, (...) holistic way of knowing and learning informed by Kiribati cosmology embedded within people’s experiences and understanding of the coconut tree. Its life-centeredness has the potential to contextualise the theological curriculum and teaching methodology to assist in equipping theological students with climate change-sensitive approaches. The qualitative method was utilised to allow participants to reflect on their experiences of climate change in relation to the mission of the church. The data that informs this article was generated through unstructured interviews and focus group discussions with members of the Kiribati Uniting Church (KUC). The data was analysed using symbolic interactionism. The results suggest that the Kiribati people symbolically interact with God through their understanding of the coconut tree, which is conceived as the embodiment of God’s presence. It became clear that while this world view informs the faith of members of the KUC, the TTC curriculum has sidelined it, resulting in miseducation of pastors because this omission means they are not equipped to engage with the challenge of climate change. The participants argued that there is an urgent need to understand theological education and ministerial formation within the indigenous framework of Kiribati coconut imagination that is embedded in the promotion of justice and equitable society not only for human beings but for all of God’s creation through symbolic interaction with the presence of God in the coconut. (shrink)

In the first part of the article, we show that if $\omega \le \kappa < \lambda$ are cardinals, ${\kappa ^{ < \kappa }} = \kappa$, and λ is weakly compact, then in $V\left[M {\left} \right]$ the tree property at $$\lambda = \left^{V\left[ {\left} \right]} $$ is indestructible under all ${\kappa ^ + }$-cc forcing notions which live in $V\left[ {{\rm{Add}}\left} \right]$, where ${\rm{Add}}\left$ is the Cohen forcing for adding λ-many subsets of κ and $\left$ is the standard Mitchell forcing (...) for obtaining the tree property at $\lambda = \left^{V\left[ {\left} \right]} $. This result has direct applications to Prikry-type forcing notions and generalized cardinal invariants. In the second part, we assume that λ is supercompact and generalize the construction and obtain a model ${V^{\rm{*}}}$, a generic extension of V, in which the tree property at ${\left^{{V^{\rm{*}}}}}$ is indestructible under all ${\kappa ^ + }$-cc forcing notions living in $V\left[ {{\rm{Add}}\left} \right]$, and in addition under all forcing notions living in ${V^{\rm{*}}}$ which are ${\kappa ^ + }$-closed and “liftable” in a prescribed sense. (shrink)