TOT states may be viewed as a temporary and reversible microamnesia. We investigated the effects of lorazepam on TOT states in response to general knowledge questions. The lorazepam participants produced more commission errors and more TOTs following commission errors than the placebo participants . The resolution of the TOTs was unimpaired by the drug. Neither feeling-of-knowing accuracy nor recognition were affected by lorazepam. The higher level of incorrect recalls produced by lorazepam participants may be due to the fact that they (...) were more frequently temporarily unable to access a known item. For some of these items, the awareness of the retrieval failure resulted in a commission TOT . The resolution of the TOT conflict is discussed in the light of the anxiolytic and anticonflict effects of lorazepam. The data are discussed in terms of contemporary theories of TOTs and the effects that benzodiazepines have on semantic memory. (shrink)

Background: Walking while performing a secondary task walking) increases cognitive workload in young adults. To date, few studies have used neurophysiological measures in combination to subjective measures to assess cognitive workload during a walking task. This combined approach can provide more insights into the amount of cognitive resources in relation with the perceived mental effort involving in a walking task.Research Question: The objective was to examine cognitive workload in young adults during walking conditions varying in complexity.Methods: Twenty-five young adults performed (...) four conditions: usual walking, simple DT walking, complex DT walking and standing while subtracting. During the walking task, mean speed, cadence, stride time, stride length, and their respective coefficient of variation were recorded. Cognitive workload will be measured through changes in oxy- and deoxy-hemoglobin during walking in the dorsolateral prefrontal cortex and perceived mental demand score from NASA-TLX questionnaire.Results: In young adults, ΔHbO2 in the DLPFC increased from usual walking to both DT walking conditions and standing while subtracting condition. ΔHbO2 did not differ between the simple and complex DT and between the complex DT and standing while subtracting condition. Perceived mental demand gradually increased with walking task complexity. As expected, all mean values of gait parameters were altered according to task complexity. CV of speed, cadence and stride time were significantly higher during DT walking conditions than during usual walking whereas CV of stride length was only higher during complex DT walking than during usual walking.Significance: Young adults had greater cognitive workload in the two DT walking conditions compared to usual walking. However, only the mental demand score from NASA-TLX questionnaire discriminated simple from complex DT walking. Subjective measure provides complementary information to objective one on changes in cognitive workload during challenging walking tasks in young adults. These results may be useful to improve our understanding of cognitive workload during walking. (shrink)

This article gives insight into the world of 3rd century BCE Alexandrian Judaism by analysing one aspect of the Greek translation of Exodus and provides a detailed evaluation of the way the translator managed to express the essence of the Hebrew text of Exodus while reflecting to some degree the form of the Hebrew text. No previous study only analyses this translator’s treatment of Hebrew paronymous infinitive absolute constructions in Greek Exodus. This research contributes to the preparation of a commentary (...) on Greek Exodus in the Society of Biblical Literature Septuagint Commentary Series. Using the Göttingen text of Greek Exodus prepared by John William Wevers, it evaluates how this translator rendered each occurrence of a paronymous infinitive absolute construction in Hebrew Exodus, defining the primary modes employed and also seeking to explain variations from these norms. The primary method incorporates a close exegetical reading of both the Hebrew and Greek texts and comparing their texts, in order to discern how the translator treated this Hebrew idiom and illustrating his translation approach.Contribution: The results contribute to our understanding of how the translator of Greek Exodus approached his task. He was more concerned to express the sense of the Hebrew text, than producing a literal translation. He generally follows the Hebrew text’s word order, but is creative in his choice of Greek equivalents, often showing sensitivity to context and Greek idiom. This translation approach differentiates this translator’s approach somewhat from those responsible for other portions of the Pentateuch. (shrink)

Many have thought that there is a problem with causal commerce between immaterial souls and material bodies. In Physicalism or Something Near Enough, Jaegwon Kim attempts to spell out that problem. Rather than merely posing a question or raising a mystery for defenders of substance dualism to answer or address, he offers a compelling argument for the conclusion that immaterial souls cannot causally interact with material bodies. We offer a reconstruction of that argument that hinges on two premises: Kim’s Dictum (...) and the Nowhere Man principle. Kim’s Dictum says that causation requires a spatial relation. Nowhere Man says that souls can’t be in space. By our lights, both premises can be called into question. We’ll begin our evaluation of the argument by pointing out some consequences of Kim’s Dictum. For some, these will be costs. We will then present two defeaters for Kim’s Dictum and a critical analysis of Kim’s case for Nowhere Man. The upshot is that Kim’s argument against substance dualism fails. (shrink)

We introduce the notion of a lovely pair of models of a simple theory T, generalizing Poizat's “belles paires” of models of a stable theory and the third author's “generic pairs” of models of an SU-rank 1 theory. We characterize when a saturated model of the theory TP of lovely pairs is a lovely pair , finding an analog of the nonfinite cover property for simple theories. We show that, under these hypotheses, TP is also simple, and we (...) study forking and canonical bases in TP. We also prove that assuming only that T is low, the existentially universal models of the universal part of a natural expansion TP+ of TP, are lovely pairs, and “simple Robinson universal domains”. (shrink)

We investigate the pair-splitting number $\germ{s}_{pair}$ which is a variation of splitting number, pair-reaping number $\germ{r}_{pair}$ which is a variation of reaping number and cardinal invariants of ideals on ω. We also study cardinal invariants of F σ ideals and their upper bounds and lower bounds. As an application, we answer a question of S. Solecki by showing that the ideal of finitely chromatic graphs is not locally Katětov-minimal among ideals not satisfying Fatou's lemma.

TheK-trivial sets form an ideal in the Turing degrees, which is generated by its computably enumerable members and has an exact pair below the degree of the halting problem. The question of whether it has an exact pair in the c.e. degrees was first raised in [22, Question 4.2] and later in [25, Problem 5.5.8].We give a negative answer to this question. In fact, we show the following stronger statement in the c.e. degrees. There exists aK-trivial degreedsuch that (...) for all degreesa, bwhich are notK-trivial anda > d, b > dthere exists a degreevwhich is notK-trivial anda > v, b > v. This work sheds light to the question of the definability of theK-trivial degrees in the c.e. degrees. (shrink)

This paper summarizes paired courses, a technique that is being used to incorporate the benefits of liberal arts into the business curriculum. This technique pairs a required business course with a liberal arts course that students take concurrently during a semester. The courses have overlapping themes and activities to build specific competencies that are desired by organizations, such as communication, critical thinking and problem solving, emotional intelligence, and organizational professionalism. These competencies are identified by exploring national surveys and conducting a (...) local survey of business professionals. The paired courses utilize a variety of exercises with the ultimate goals of building desired workplace-related skills in students and improving their practical reasoning ability. The exercises do this by strengthening students’ analytical thinking, understanding of multiple framing, and reflective exploration of meaning through various techniques. Many of the activities are explained in detail with some additional resources provided. Teachers can utilize the same activities or adapt them to their classroom. (shrink)

The goal of this paper is to show that a particular view of emotion sharing and a specific hypothesis on infant social perception strengthen each other. The view of emotion sharing is called “the straightforward view.” The hypothesis on infant social perception is called “the pairing account.” The straightforward view suggests that participants in emotion sharing undergo one and the same overarching emotion. The pairing account posits that infants perceive others’ embodied experiences as belonging to someone other than the self (...) through a process of assimilation to, and accommodation of, their own embodied experience. The connection between the two theories lies in the domain-general process of association by similarity, which functions both in the individuation of a unitary emotion and in the interpretation of the sensory stimulus. By elaborating on this connection, the straightforward view becomes more solid from the cognitive-developmental standpoint and the pairing account expands its explanatory power. Since the straightforward view requires minimal forms of self- and other-awareness, the paper provides a characterization of the developmental origin of the sense of us, i.e., the experience of self and other as co-subjects of a shared emotional state. (shrink)

In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. First, we show that first-order theories of finite signature that have functional non-surjective ordered pairing are definitionally equivalent to extensions in the same language of the basic theory of non-surjective ordered pairing. Second, we show that a first-order theory of finite signature is sequential (is a theory of sequences) iff it is (...) definitionally equivalent to an extension in the same language of a system of weak set theory called WS. (shrink)

For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a characterization of (...) linearity for SU-rank 1 structures by giving several equivalent conditions on T*, find a “weak” version of local modularity which is equivalent to linearity, show that linearity coincides with 1-basedness, and use the generic pairs to “recover” projective geometries over division rings from non-trivial linear SU-rank 1 structures. (shrink)

A secondary analysis was performed on preliminary data from an ongoing cross-cultural study on assortative pairing. Independently sampled pairs of opposite-sex romantic partners and of same-sex friends rated themselves and each other on Life History (LH) strategy and mate value. Data were collected in local bars, clubs, coffeehouses, and other public places from three different cultures: Tucson, Arizona; Hermosillo, Sonora; and San José, Costa Rica. The present analysis found that slow LH individuals assortatively pair with both sexual and social (...) partners more strongly than fast LH individuals. We interpret this phenomenon as representing (1) an adaptation for preserving coadapted genomes in slow LH strategists to maintain high copying fidelity genetic replication while producing a lower number of offspring in stable, predictable, and controllable environments and (2) a bet-hedging adaptation in fast LH strategists, favoring the genetic diversification of a higher number of offspring in unstable, unpredictable, and uncontrollable environments. (shrink)

We prove that certain pairs of ordered structures are dependent. Among these structures are dense and tame pairs of o-minimal structures and further the real field with a multiplicative subgroup with the Mann property, regardless of whether it is dense or discrete.

The study of pairs of modules (over a Dedekind domain) arises from two different perspectives, as a starting step in the analysis of tuples of submodules of a given module, or also as a particular case in the analysis of Abelian structures made by two modules and a morphism between them. We discuss how these two perspectives converge to pairs of modules, and we follow the latter one to obtain an alternative approach to the classification of pairs of torsionfree objects. (...) Then we restrict our attention to pairs of free modules. Our main results are that the theory of pairs of free Abelian groups is co-recursively enumerable, and that a few remarkable extensions of this theory are decidable. (shrink)

In an attempt to give a unified account of common properties of various resource bounded reducibilities, we introduce conditions on a binary relation ≤r between subsets of the natural numbers, where ≤r is meant as a resource bounded reducibility. The conditions are a formalization of basic features shared by most resource bounded reducibilities which can be found in the literature. As our main technical result, we show that these conditions imply a result about exact pairs which has been previously shown (...) by Ambos-Spies [2] in a setting of polynomial time bounds: given some recursively presentable ≤r-ideal I and some recursive ≤r-hard set B for I which is not contained in I, there is some recursive set C, where B and C are an exact pair for I, that is, I is equal to the intersection of the lower ≤r-cones of B and C, where C is not in I. In particular, if the relation ≤r is in addition transitive and there are least sets, then every recursive set which is not in the least degree is half of a minimal pair of recursive sets. (shrink)

We adjust the notion of finitary filter pair, which was coined for creating and analyzing finitary logics, in such a way that we can treat logics of cardinality $$\kappa $$, where $$\kappa $$ is a regular cardinal. The corresponding new notion is called $$\kappa $$ -filter pair. A filter pair can be seen as a presentation of a logic, and we ask what different $$\kappa $$ -filter pairs give rise to a fixed logic of cardinality $$\kappa $$. (...) To make the question well-defined we restrict to a subcollection of filter pairs and establish a bijection from that collection to the set of natural extensions of that logic by a set of variables of cardinality $$\kappa $$. Along the way we use $$\kappa $$ -filter pairs to construct natural extensions for a given logic, work out the relationships between this construction and several others proposed in the literature, and show that the collection of natural extensions forms a complete lattice. In an optional section we introduce and motivate the concept of a general filter pair. (shrink)

This article argues that intersectional analyses of care work also need to include a temporal aspect. Drawing on ethnographic research on Slovak au pairs working in the UK and on interviews with both providers and employers of paid childcare in Slovakia, I examine how the temporariness of care work is created within both migrant and non-migrant settings. In particular, I demonstrate that both employers and providers conceptualise paid childcare as a temporary period in their lives and show the consequences of (...) this conceptualisation in their valuing of care work. In both examined cases, I focus on the role of care/welfare and migration regimes in the production of temporariness in care work and argue that both providers and employers of paid care construct their involvement in domestic work as a specific life course experience. While for au pairs, working stays in the UK represent a specific transition period from adolescence to adulthood, employers in Slovakia decide to employ particular types of domestic workers in relation to the particular developmental phases of their families and households. (shrink)

The causal pairing problem allegedly renders nonphysical minds causally impotent. This article demonstrates how a dualist view I call neo-Thomistic hylomorphism can circumnavigate the causal pairing problem. After explicating the problem and hylomorphism, I provide an account of causal pairing that appeals to a foundational tenet of hylomorphism. Subsequently, I suggest that a prominent view of consciousness in theoretical neuroscience—the integrated information theory—can learn from hylomorphism and likewise account for causal pairing.

This paper evaluates Husserl’s and Merleau-Ponty’s phenomenological notion of pairing in light of a representative variety of findings and views in contemporary developmental psychology. This notion belongs to the direct social perception framework, which suggests that the fundamental access to other minds is intuitive, or perceptual. Pairing entails that the perception of other minds relies merely on first-person embodied experience and domain-general processes. For this reason, pairing is opposed to cognitive nativist views that assume specialized mechanisms for low-level mental state (...) attribution, while it is compatible with acknowledging innate affective tendencies. I criticize cognitive nativism for being based on ambiguous evidence. I argue that in early social interactions infants experience sufficient self–other similarities to ground the most primitive perception of others as minded beings. I show that pairing can account for the ontogenetically earliest perceptions of others’ actions and emotions, as well as for the earliest perception of others’ perceptions. (shrink)

When word pairs having a familiar order are sequentially flashed on a computer in their non-familiar order, , observers have a strong phenomenology of seeing them in familiar order . Reversal errors remained frequent even when participants obtained perceptual experience of reverse-display items by beginning with a block of longer-duration trials. A forced-choice order-detection procedure reduced but did not eliminate reversal errors, showing that “fast pairs” is a robust perceptual illusion. Even adjective + noun pairs showed reversal errors, and reversal (...) errors increased with the log frequency of the word pair, consistent with a strong role for statistical processing at the level of multi-word units. (shrink)

Computably Lipschitz reducibility , was suggested as a measure of relative randomness. We say α≤clβ if α is Turing reducible to β with oracle use on x bounded by x+c. In this paper, we prove that for any non-computable real, there exists a c.e. real so that no c.e. real can cl-compute both of them. So every non-computable c.e. real is the half of a cl-maximal pair of c.e. reals.

In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn + that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte für Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Séances De la Société des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Słupecki in Stud (...) Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn − that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Słupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdań odrzuconych, 5–131, Zeszyty Naukowe Wyższej Szkoły Inżynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn + and Cn − can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple: $$\begin{array}{ll}{\rm by\,the\,triple}:\hspace{1.4cm} (+ , -)\hspace{0,6cm} \\ {\rm or\,by\,the\,triple}:\hspace{1.0cm} (-, +)\hspace{0,6cm} .\end{array}$$ We compare axiom systems for operations of the types Cn + and Cn −, give some methodological properties of deductive systems defined by means of these operations (e.g. consistency, completeness, decidability in Łukasiewicz’s sense), as well as formulate different metatheorems concerning them. (shrink)

Being based on the observation that a conjugate pair of representations, or dual logic, is a necessity under the presence of chaos, a new interpretation of quantum theory is proposed as describingproto-chaos. This chaos has to be a result of basic nonlinearity in the dynamic structure, of which, however, the nonchaotic phase seems to lie ourside the reach of experimental technique, thus the term proto-chaos. Nevertheless, assuming no extra degrees of freedom, the interpretation clarifies a number of riddles posed (...) hitherto and throws some light on the overall hierarchical structure of our understanding and description of nature. (shrink)