There are close similarities between the Weihrauch lattice and the zoo of axiom systems in reverse mathematics. Following these similarities has often allowed researchers to translate results from one setting to the other. However, amongst the big five axiom systems from reverse mathematics, so far $\mathrm {ATR}_0$ has no identified counterpart in the Weihrauch degrees. We explore and evaluate several candidates, and conclude that the situation is complicated.

Zen Training is a comprehensive handbook for zazen , seated meditation practice, and an authoritative presentation of the Zen path. The book marked a turning point in Zen literature in its critical reevaluation of the enlightenment experience, which the author believes has often been emphasized at the expense of other important aspects of Zen training. In addition, Zen Training goes beyond the first flashes of enlightenment to explore how one lives as well as trains in Zen. The author also draws (...) many significant parallels between Zen and Western philosophy and psychology, comparing traditional Zen concepts with the theories of being and cognition of such thinkers as Heidegger and Husserl. (shrink)

This article presents a unified theory of irony which claims, with the help of Fauconnier’s (1985) mental space theory, that an ironical utterance refers to the mental space of a mutually manifest expectation. According to this view, what a typical ironical speaker does is to say without any distinct space builders that something is the case in the mental space of expectation in order to make it mutually manifest that it is not so in the initial reality space. This expectation (...) space theory of irony integrates the explanatory power of Sperber and Wilson’s (1986) echoic interpretation theory with the descriptive power of the view of irony as relevant inappropriateness. (shrink)

We examined whether children's ability to integrate speech and gesture follows the pattern of a broader developmental shift between 3- and 5-year-old children regarding the ability to process two pieces of information simultaneously. In Experiment 1, 3-year-olds, 5-year-olds, and adults were presented with either an iconic gesture or a spoken sentence or a combination of the two on a computer screen, and they were instructed to select a photograph that best matched the message. The 3-year-olds did not integrate information in (...) speech and gesture, but 5-year-olds and adults did. In Experiment 2, 3-year-old children were presented with the same speech and gesture as in Experiment 1 that were produced live by an experimenter. When presented live, 3-year-olds could integrate speech and gesture. We concluded that development of the integration ability is a part of the broader developmental shift; however, live-presentation facilitates the nascent integration ability in 3-year-olds. (shrink)

In this article, we propose a new classification of $\Sigma ^0_2$ formulas under the realizability interpretation of many-one reducibility (i.e., Levin reducibility). For example, $\mathsf {Fin}$, the decision of being eventually zero for sequences, is many-one/Levin complete among $\Sigma ^0_2$ formulas of the form $\exists n\forall m\geq n.\varphi (m,x)$, where $\varphi $ is decidable. The decision of boundedness for sequences $\mathsf {BddSeq}$ and for width of posets $\mathsf {FinWidth}$ are many-one/Levin complete among $\Sigma ^0_2$ formulas of the form $\exists n\forall (...) m\geq n\forall k.\varphi (m,k,x)$, where $\varphi $ is decidable. However, unlike the classical many-one reducibility, none of the above is $\Sigma ^0_2$ -complete. The decision of non-density of linear orders $\mathsf {NonDense}$ is truly $\Sigma ^0_2$ -complete. (shrink)

Neoliberal reforms have changed the conduct of academic research in, and beyond, science, technology and society. Social science scholars have undertaken critical studies regarding the negative consequences of neoliberalism, such as the globalization of poverty and the inattention to rights and fairness. However, science and technology studies (STS), which should take a critical approach to science and technology, has generally not addressed the problem of neoliberalism. Rather, some currents in STS may be viewed as supportive of neoliberal transformations. 1 Why (...) is this so? To address this question, Japanese public policy will provide a case study. In Japan, public policy changed, affected by neoliberal reforms in the 1990s. Consequently, a broad area of Japanese social sciences was altered regarding how to be engaged in public policy. STS in Japan was formed at this time and shifted to neoliberal public policy. As a result STS, as well as many other social sciences, transformed their critical function. These circumstances seem to have overlapped and caused STS in Japan to be uncritical of neoliberalism. (shrink)

In social contexts, people are responsible for their actions and outcomes. Diffusion of responsibility is a well-known social phenomenon: people feel less responsible when performing an action with co-actors than when acting alone. In previous studies, co-actors reduced the participant’s responsibility attribution by making the cause of the outcomes ambiguous. Meanwhile, it is unclear whether the presence of co-actors creates diffusion of responsibility even in situations where it is “obvious” that both oneself and the co-actor are the causes of an (...) outcome. To investigate this potential diffusion of responsibility, we used a temporal binding task as a measure of causal attribution. Low TB effects indicate the enhancement of external attribution in perceptual processing for the action and outcomes. To investigate the influence of presence of a co-actor on causal attribution, participants were required to act under two experimental conditions: an ALONE condition or a TOGETHER condition. The only difference between the two conditions was whether the actions were shared. In addition, to make participants feel responsible, they were induced to feel guilt. In the High-harm condition, participants gave a financial reduction to a third party. When guilt was induced, participants showed lower TB effects in the TOGETHER condition compared to the ALONE condition. Our study suggests that actions with a co-actor change causal attributions even though the causes of the outcome are obvious. This may have implications for understanding diffusion of responsibility in inhumane situations. (shrink)

In this article, we study an analogue of tt-reducibility for points in computable metric spaces. We characterize the notion of the metric tt-degree in the context of first-level Borel isomorphism. Then, we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension theory.

We clarify the significance of quasiprobability in quantum mechanics that is relevant in describing physical quantities associated with a transition process. Our basic quantity is Aharonov’s weak value, from which the QP can be defined up to a certain ambiguity parameterized by a complex number. Unlike the conventional probability, the QP allows us to treat two noncommuting observables consistently, and this is utilized to embed the QP in Bohmian mechanics such that its equivalence to quantum mechanics becomes more transparent. We (...) also show that, with the help of the QP, Bohmian mechanics can be recognized as an ontological model with a certain type of contextuality. (shrink)

A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of compact Polish spaces. We show that there exists a $\mathbf {0}'$ -computable low $_3$ compact Polish space which is not homeomorphic to a computable one, and that, for any natural number $n\geq 2$, there exists a Polish space $X_n$ such that exactly the high $_{n}$ -degrees are required to present the homeomorphism type of $X_n$. (...) Along the way we investigate the computable aspects of Čech homology groups. We also show that no compact Polish space has a least presentation with respect to Turing reducibility. (shrink)

フェミニズムの歴史とは、「私たちとは誰なのか」を批判的に問うてきた歴史でもある。フェミニストとして語るあなたとは誰なのか。その語りはどんな場所からなされているのか。その語りからは誰が排除されているのか 。「私たちが共にあること」はいかにして可能なのか。フェミニズムはもちろん一枚岩ではない。それでも、私にとってのフェミニズムとは、自己の、そして他者の“トラブル”に直面しながらその声に応答しようとしてき たフェミニズムである。ジュディス・バトラーの『ジェンダー・トラブル』と、田中美津の「とり乱し」を架橋する、理論と実践の両面からの試み。.

Consider a randomness notion C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}. A uniform test in the sense of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} is a total computable procedure that each oracle X produces a test relative to X in the sense of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}. We say that a binary sequence Y is C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}-random uniformly relative to (...) X if Y passes all uniform C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} tests relative to X. Suppose now we have a pair of randomness notions C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} and D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document} where C⊆D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C} \subseteq \mathcal{D}}$$\end{document}, for instance Martin-Löf randomness and Schnorr randomness. Several authors have characterized classes of the form Low which consist of the oracles X that are so feeble that C⊆DX\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C} \subseteq \mathcal{D}^X}$$\end{document}. Our goal is to do the same when the randomness notion D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document} is relativized uniformly: denote by Low \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\star}$$\end{document} the class of oracles X such that every C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}-random is uniformly D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document}-random relative to X. We show that X∈Low⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\in Low ^\star}$$\end{document} if and only if X is c.e. tt-traceable if and only if X is anticomplex if and only if X is Martin-Löf packing measure zero with respect to all computable dimension functions. We also show that X∈Low⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\in Low^\star}$$\end{document} if and only if X is computably i.o. tt-traceable if and only if X is not totally complex if and only if X is Schnorr Hausdorff measure zero with respect to all computable dimension functions. (shrink)

Louveau showed that if a Borel set in a Polish space happens to be in a Borel Wadge class $$\Gamma $$, then its $$\Gamma $$ -code can be obtained from its Borel code in a hyperarithmetical manner. We extend Louveau’s theorem to Borel functions: If a Borel function on a Polish space happens to be a $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -function, then one can find its $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -code hyperarithmetically relative to its Borel code. More generally, we prove (...) extension-type, domination-type, and decomposition-type variants of Louveau’s theorem for Borel functions. (shrink)

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on (...) the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture. (shrink)

We introduce the notion of a convex tree. We show that the binary expansion for real numbers in the unit interval ) is equivalent to weak König lemma ) for trees having at most two nodes at each level, and we prove that the intermediate value theorem is equivalent to \ for convex trees, in the framework of constructive reverse mathematics.

Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding Hall condition and computable local finiteness for boys and girls. The strength of the marriage theorem reaches or if computable expanding Hall condition or computable local finiteness for girls is weakened. In contrast, the provability of the marriage theorem is maintained in even if local finiteness for boys is completely removed. Using these conditions, we classify the strength of variants of marriage theorems in (...) the context of reverse mathematics. Furthermore, we introduce another condition that also makes the marriage theorem provable in, and investigate the sequential and Weihrauch strength of marriage theorems under that condition. (shrink)

It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial Π10 subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise computability. As for nonempty Π10 subsets of Cantor space, we show the existence of a finite-Δ20-piecewise degree containing infinitely many finite-2-piecewise degrees, and a finite-2-piecewise degree containing infinitely many finite-Δ20-piecewise degrees 2 denotes the difference of two Πn0 sets), whereas the greatest degrees in (...) these three “finite-Γ-piecewise” degree structures coincide. Moreover, as for nonempty Π10 subsets of Cantor space, we also show that every nonzero finite-2-piecewise degree includes infinitely many Medvedev degrees, every nonzero countable-Δ20-piecewise degree includes infinitely many finite-piecewise degrees, every nonzero finite-2-countable-Δ20-piecewise degree includes infinitely many countable-Δ20-piecewise degrees, and every nonzero Muchnik degree includes infinitely many finite-2-countable-Δ20-piecewise degrees. Indeed, we show that any nonzero Medvedev degree and nonzero countable-Δ20-piecewise degree of a nonempty Π10 subset of Cantor space have the strong anticupping properties. Finally, we obtain an elementary difference between the Medvedev degree structure and the finite-Γ-piecewise degree structure of all subsets of Baire space by showing that none of the finite-Γ-piecewise structures is Brouwerian, where Γ is any of the Wadge classes mentioned above. (shrink)

異文化コミュニケーションのスキル、仕事の現場、技術者倫理など、グローバルエンジニアを志す人に必要な情報をまとめた一冊。.

We prove the Decomposability Conjecture for functions of Baire class $2$ from a Polish space to a separable metrizable space. This partially answers an important open problem in descriptive set theory.

Own-age bias is a well-known bias reflecting the effects of age, and its role has been demonstrated, particularly, in face recognition. However, it remains unclear whether an own-age bias exists in facial impression formation. In the present study, we used three datasets from two published and one unpublished functional magnetic resonance imaging study that employed the same pleasantness rating task with fMRI scanning and preferential choice task after the fMRI to investigate whether healthy young and older participants showed own-age effects (...) in face preference. Specifically, we employed a drift-diffusion model to elaborate the existence of own-age bias in the processes of preferential choice. The behavioral results showed higher rating scores and higher drift rate for young faces than for older faces, regardless of the ages of participants. We identified a young-age effect, but not an own-age effect. Neuroimaging results from aggregation analysis of the three datasets suggest a possibility that the ventromedial prefrontal cortex was associated with evidence accumulation of own-age faces; however, no clear evidence was provided. Importantly, we found no age-related decline in the responsiveness of the vmPFC to subjective pleasantness of faces, and both young and older participants showed a contribution of the vmPFC to the parametric representation of the subjective value of face and functional coupling between the vmPFC and ventral visual area, which reflects face preference. These results suggest that the preferential choice of face is less susceptible to the own-age bias across the lifespan of individuals. (shrink)

20世紀日本を代表する哲学者の今日的意味とは?求真会主催のもと気鋭の執筆者が集ったシンポの記録。本邦初訳フッサール書簡収録。.

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify nonuniformly computable functions on Baire space from the viewpoint of learning theory and piecewise computability. For instance, we show that mind-change-bounded learnability is equivalent to finite View the MathML source2-piecewise computability 2 denotes the difference of two View the MathML sourceΠ10 sets), error-bounded learnability is equivalent to finite View (...) the MathML sourceΔ20-piecewise computability, and learnability is equivalent to countable View the MathML sourceΠ10-piecewise computability . Second, we introduce disjunction-like operations such as the coproduct based on BHK-like interpretations, and then, we see that these operations induce Galois connections between the Medvedev degree structure and associated Medvedev/ Muchnik-like degree structures. Finally, we interpret these results in the context of the Weihrauch degrees and Wadge-like games. (shrink)

We show that there is a computable procedure which, given an ∀∃-sentence ${\varphi}$ in the language of the partially ordered sets with a top element 1 and a bottom element 0, computes whether ${\varphi}$ is true in the Medvedev degrees of ${\Pi^0_1}$ classes in Cantor space, sometimes denoted by ${\mathcal{P}_s}$.

Mediator is a coregulatory complex that plays essential roles in multiple processes of transcription regulation. One of the human Mediator subunits, MED26, has a role in recruitment of the super elongation complex (SEC) to polyadenylated genes and little elongation complex (LEC) to non‐polyadenylated genes, including small nuclear RNAs (snRNAs) and replication‐dependent histone (RDH) genes. MED26‐containing Mediator plays a role in 3′ Pol II pausing at the proximal region of transcript end sites in RDH genes through recruitment of Cajal bodies (CBs) (...) to histone locus bodies (HLBs). This finding suggests that Mediator is involved in the association of CBs with HLBs to facilitate 3′ Pol II pausing and subsequent 3′‐end processing by supplying 3′‐end processing factors from CBs. Thus, we argue the possibility that Mediator is involved in the organization of nuclear bodies to orchestrate multiple processes of gene transcription. (shrink)

We investigate computability theoretic and descriptive set theoretic contents of various kinds of analytic choice principles by performing a detailed analysis of the Medvedev lattice of $\Sigma ^1_1$ -closed sets. Among others, we solve an open problem on the Weihrauch degree of the parallelization of the $\Sigma ^1_1$ -choice principle on the integers. Harrington’s unpublished result on a jump hierarchy along a pseudo-well-ordering plays a key role in solving this problem.

An emerging perspective on human cognition and performance sees it as a kind of self-organizing phenomenon involving dynamic coordination across the body, brain and environment. Measuring this coordination faces a major challenge. Time series obtained from such cognitive, behavioral, and physiological coordination are often complicated in terms of non-stationarity and non-linearity, and in terms of continuous vs. categorical scales. Researchers have proposed several analytical tools and frameworks. One method designed to overcome these complexities is recurrence quantification analysis, developed in the (...) study of non-linear dynamics. It has been applied in various domains, including linguistic data or motion data. However, most previous studies have applied recurrence methods individually to categorical or continuous data. To understand how complex coordination works, an integration of these types of behavior is needed. We aimed to integrate these methods to investigate the relationship between language and motion directly. To do so, we added temporal information to categorical data, and applied joint recurrence analysis methods to visualize and quantify speech-motion coordination coupling during a rap performance. We illustrate how new dynamic methods may capture this coordination in a small case-study design on this expert rap performance. We describe a case study suggesting this kind of dynamic analysis holds promise, and end by discussing the theoretical implications of studying complex performances of this kind as a dynamic, coordinated phenomenon. (shrink)

西洋近代を経験した東アジア各国はいかに固有の哲学を生み出しそして今どんな〈世界哲学〉の構想が可能なのか。国際共同研究の成果。.

This study adopted an empirical method to investigate lay people’s attitudes toward the bioethical issues of human-animal chimeric brains. The results of online surveys showed that (1) people did not entirely reject chimeric brain research, but showed slightly more negative responses than ordinary animal testing; and that (2) their ethical concerns arose in connection with the perception that chimerism in the brain would humanize the animal. This means that people’s psychology was consistent with the ethical argument that crossing the human-animal (...) boundary would bring moral confusion to our society. Meanwhile, it was not in line with another argument that moral status depended on having high capacities, and that chimerism would cause a problem if it enhanced animals’ capacities. Furthermore, this study analyzed additional psychological factors related to people’s moral judgment and the relationship among those factors. Several psychological factors, such as the perception that chimeric brain research is unnatural, were identified as mediating the relationship between perception of animal humanization and ethical concerns about creating and using chimeric brains. Introducing an empirical approach to the ethics of human-animal chimeric brains brought two findings: (1) this study informed us of socially shared intuition regarding this novel technology; and (2) it unveiled the psychological processes behind people’s ethical concerns in more detail than they spontaneously mentioned. These findings will help to build normative arguments and future policies that are understandable and acceptable to society. (shrink)

The moral status of human brain organoids (HBOs) has been debated in view of the future possibility that they may acquire phenomenal consciousness. This study empirically investigates the moral sensitivity in people’s intuitive judgments about actions toward conscious HBOs. The results showed that the presence/absence of pain experience in HBOs affected the judgment about the moral permissibility of actions such as creating and destroying the HBOs; however, the presence/absence of visual experience in HBOs also affected the judgment. These findings suggest (...) that people’s intuitive judgments about the moral status of HBOs are sensitive to the valence-independent value of phenomenal consciousness. We discuss how these observations can have normative implications; particularly, we argue that they put pressure on the theoretical view that the moral status of conscious HBOs is grounded solely in the valence-dependent value of consciousness. We also discuss how our findings can be informative even when such a theoretical view is finally justified or when the future possibility of conscious HBOs is implausible. (shrink)

The plasmodium of _Physarum polycephalum_ is a unicellular and multinuclear giant amoeba with computational abilities. The plasmodium has been widely used as a model organism in the field of bio-computing; however, its ability to perform computation related to its biological nature itself in the essential sense has not yet been fully realized. Therefore, in this study, we focused on the phenomenon in which a plasmodium trapped in a closed space surrounded by repellent substances escapes from the field by changing its (...) own behavior rules. We demonstrated that this phenomenon is bio-computationally important in that it may enable the implementation of biological characteristics in computing. (shrink)

This paper examines the history of Japanese genetics in the 1920s to 1950s as seen through the work of Hitoshi Kihara, a prominent wheat geneticist as well as a leader in the development of the discipline in Japan. As Kihara's career illustrates, Japanese genetics developed quickly in the early twentieth century through interactions with biologists outside Japan. The interactions, however, ceased due to the war in the late 1930s, and Japanese geneticists were mostly isolated from outside information until (...) the late 1940s. During the isolation in wartime and under the postwar U.S. Occupation, Kihara adapted to political changes. During wartime, he developed a research institute focusing on applied biology of various crops, which conformed to the national need to address food scarcity. After the war, he led the campaign for the establishment of a national institute of genetics and negotiated with American Occupation officers. The Americans viewed this Japanese effort with suspicion because of the rising popularity of the controversial theory of the Russian agronomist, Trofim Lysenko, in Japan. The institute was approved in 1949 partly because Kihara was able to bridge the gap between the American and Japanese sides. With Kihara's flexible and generous leadership, Japanese genetics steadily developed, survived the wartime, and recovered quickly in the postwar period. The article discusses Kihara's interest in cytoplasmic inheritance and his synthetic approach to genetics in this political context, and draws attention to the relation between Kihara's genetics and agricultural practice in Japan. (shrink)