In this paper, we generalize a result of Brown and Simpson [1] to prove that RCA0+Π0∞-BCT is conservative over RCA0 with respect to the set of formulae in the form ∃!Xφ, where φ is arithmetical. We also consider the conservation of Π00∞-BCT over Σb1-NIA+∇b1-CA.

The discovery of the signal peptides that direct proteins to localize at the nucleolus is described here. The nucleolar targeting signal termed the NOS consists of clustered basic amino acids organized such that a portion also functions as the nuclear transporting signal. Although a NOS has been identified within the regulatory genes of human retroviruses, HTLV‐I and HIV‐I, signals of similar function in cellular proteins – such as heat shock proteins – may be induced through the configurational change of protein (...) structure by heat or stress. (shrink)

Specular reflections and refractive distortions are complex image properties of solid transparent objects, but despite this complexity, we readily perceive the 3D shapes of these objects. We have found in past work that relevant sources of scene complexity have differential effects on 3D shape perception, with specular reflections increasing perceived thickness, and refractive distortions decreasing perceived thickness. In an object with both elements, such as glass, the two optical properties may complement each other to support reliable perception of 3D shape. (...) We investigated the relative dominance of specular reflection and refractive distortions in the perception of shape. Surprisingly, the ratio of specular reflection to refractive component was almost equal to that of ordinary glass and ice, which promote correct percepts of 3D shape. The results were also explained by the variance in local RMS contrast in stimulus images but may depend on overall luminance and contrast of the surrounding light field. (shrink)

In this paper, we investigate the logical strength of completeness theorems for intuitionistic logic along the program of reverse mathematics. Among others we show that is equivalent over to the strong completeness theorem for intuitionistic logic: any countable theory of intuitionistic predicate logic can be characterized by a single Kripke model.

Using anthropological theory, this paper examines human–android interactions (HAI) as an emerging aspect of android science. These interactions are described in terms of adaptive learning (which is largely subconscious). This article is based on the observations reported and supplementary data from two studies that took place in Japan with a teleoperated android robot called Telenoid in the socialization of school children and older adults. We argue that interacting with androids brings about a special context, an interval, and a space/time for (...) reflection and imagination that was not there before. During the interaction something happens. There is adaptive learning and as a result, both children and older adults accepted Telenoid, and the children and older adults accepted each other. Using frames of play and ritual, we make sense and ‘capture’ moments of adaptive learning, and the feedback that elicits a social response from all study participants that results in self-efficacy and socialization. While “ritual” refers to the application of what has been learned and “play” means that there are no obvious consequences of what has been learned. This analysis illuminates new understanding about the uncanny valley, cultural robotics and the therapeutic potential of HAI. This has implications for the acceptance of androids in ‘socialized roles’ and gives us insight into the subconscious adaptive learning processes that must take place within humans to accept androids into our society. This approach aims to provides a clearer conceptual basis and vocabulary for further research of android and humanoid development. (shrink)

In this paper, we discuss uniform versions of some axioms of second order arithmetic in the context of higher order arithmetic. We prove that uniform versions of weak weak König's lemma WWKL and Σ01 separation are equivalent to over a suitable base theory of higher order arithmetic, where is the assertion that there exists Φ2 such that Φf1 = 0 if and only if ∃x0 for all f. We also prove that uniform versions of some well-known theorems are equivalent to (...) or the axiom of the existence of the Suslin operator. (shrink)

Experimental studies have developed, conducted, and evaluated classroom interventions for foreign language anxiety reduction. However, various characteristics of those classroom interventions make it difficult to synthesize the findings and apply them to practice. We conducted what is, to the best of our knowledge, the first systematic review on educational interventions for FLA. Six criteria were established for inclusion of studies. Using English keywords, we identified 854 potentially eligible studies through ProQuest and Scopus, 40 of which were finally included. All included (...) studies were published from 2007 to 2020. The studies differed in type of intervention, duration of intervention, and scale to measure FLA. Our systematic review resulted in seven features of classroom interventions, categorized as student–student interactions, student-teacher interactions, self-management, and mood boosters; we also categorized interventions as either individual or interactional. (shrink)

構造主義からアクターネットワークセオリーまで、哲学と人類学という二つの知的実践は交錯してきた。その現代的な意義を考える。 ドゥルーズ=ガタリ、メルロ=ポンティ、サルトル、モース、デュルケム、ヴィヴェイロス・デ・カストロ、デスコラ、ストラザーン――いずれも「自然」をめぐり、レヴィ=ストロースの神話論理の再解釈や「構造」の捉 えなおしとして進行してきた哲学と人類学について、思考様式の違いや歴史的な影響関係、主題の反復を浮き彫りにする。.

Currently in Japan, discontinuing an invasive mechanical ventilator (IMV) is illegal; therefore IMV-related decision making is a crucial issue. This study examined IMV decision-making factors and psychological conflict in 50 patients with amyotrophic lateral sclerosis. The Herth Hope Index was used for the assessment of pre- and post-IMV conflict. Interviews identified some decision-making factors: patient’s decision, patient’s and family’s mutual decision, family’s decision, and emergency-induced without patient’s or family’s consent. Participants who experienced no IMV-related regret received sufficient prior IMV education (...) from physicians and nurses, and time for reflection and family consultation. Their hope was similar to their pre-onset levels. Patients who received no prior IMV education accepted treatment as a natural progression. Their hope levels were lower than pre-onset. Those who received only a brief prior IMV explanation rejected the ventilator, experiencing regret if they were given an emergency IMV. Their hope levels were among the lowest. However, some of these patients managed to overcome their regret through being helped by nurses. Sufficient physician explanation and nursing advocacy for autonomous patient decision making are critical for improving hope in this patient group. (shrink)

In our former works, for a given concept of reduction, we study the following hypothesis: “For a random oracle A, with probability one, the degree of the one-query tautologies with respect to A is strictly higher than the degree of A.” In our former works (Suzuki in Kobe J. Math. 15, 91–102, 1998; in Inf. Comput. 176, 66–87, 2002; in Arch. Math. Logic 44, 751–762), the following three results are shown: The hypothesis for p-T (polynomial-time Turing) reduction is equivalent to (...) the assertion that the probabilistic complexity class R is not equal to NP; The hypothesis for p-tt (polynomial-time truth-table) reduction implies that P is not NP; The hypothesis holds for each of the following: disjunctive reduction, conjunctive reduction, and p-btt (polynomial-time bounded-truth-table) reduction. In this paper, we show the following three results: (1) Let c be a positive real number. We consider a concept of truth-table reduction whose norm is at most c times size of input, where for a relativized propositional formula F, the size of F denotes the total number of occurrences of propositional variables, constants and propositional connectives. Then, our main result is that the hypothesis holds for such tt-reduction, provided that c is small enough. How small c can we take so that the above holds? It depends on our syntactic convention on one-query tautologies. In our setting, the statement holds for all c < 1. (2) The hypothesis holds for monotone truth-table reduction (also called positive reduction). (3) Dowd (in Inf. Comput. 96, 65–76, 1992) shows a polynomial upper bound for the minimum sizes of forcing conditions associated with a random oracle. We apply the above result (1), and get a linear lower bound for the sizes. (shrink)