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.

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)

朱子がめざした新たな学問とはどのような歴史的背景を踏まえ、何を追究したのか?歴史の現場に降り立ち、侵略や飢餓などに苦しむ人々の日常に直面した民政官たち、母権としての「母皇」が国政の中枢において「国権」 を簒奪しようとする深刻な危機感、これらの現実に向き合って営まれた苦心と創意が、政治を本源とする経学の形成過程にいかに織り込まれていったか。民政官、母権、馴致、現実をキータームにして、著者は思想の誕生す る姿を広範な文献を駆使して生き生きと描出し、中国思想研究に新しい地平を切り開いた。皇帝専制、家父長制的支配、家産官僚という学術用語は「皇帝―吏」関係を絶対的な命令者と服従者として捉え、そこには独自の内 面性を有する皇帝や吏は存在しえない。自己の馴致を核心にし、物事についての知の精度を磨き、民生の現場の安寧に取り組むことを通して学へと高まっていく中国思想の本質に迫る。.

本書の3つの工夫:(1)企業不祥事や長時間労働など、現実のさまざまな問題を取り上げて解説しています。(2)倫理学や経済学を学んだことがなくても読み進められるように、用語の説明を丁寧に行っています。(3 )興味や関心に合わせて読むことができるように、各章のタイトルを問いかけの形式にしています。.

This study examined why intensive care unit (ICU) nurses experience difficulties in respecting the wishes of patients in end-of-life care in Japan. A questionnaire survey was conducted with ICU nurses working in Japanese university hospitals. The content of their narratives was analyzed concerning the reasons why the nurses believed that patients' wishes were not respected. The most commonly stated reason was that patients' wishes were impossible to realize, followed by the fact that decision making was performed by others, regardless of (...) whether the patients' wishes were known, if the death was sudden, and time constraints. Many nurses wanted to respect the wishes of dying patients, but they questioned how patients die in ICUs and were therefore faced with ethical dilemmas. However, at the same time, many of the nurses realized that respecting patients' wishes about end-of-life care in an ICU would be difficult and that being unable to respect these wishes would often be unavoidable. The results thus suggest that there has been insufficient discussion about respecting the wishes of patients undergoing intensive care. (shrink)

Quantum measurement is a physical process. A system and an apparatus interact for a certain time period, and during this interaction, information about an observable is transferred from the system to the apparatus. In this study, we quantify the energy fluctuation of the quantum apparatus required for this physical process to occur autonomously. We first examine the so-called standard model of measurement, which is free from any non-trivial energy–time uncertainty relation, to find that it needs an external system that switches (...) on the interaction between the system and the apparatus. In such a sense this model is not closed. Therefore to treat a measurement process in a fully quantum manner we need to consider a “larger” quantum apparatus which works also as a timing device switching on the interaction. In this setting we prove that a trade-off relation, \, holds between the energy fluctuation \ of the quantum apparatus and the measurement time \. We use this trade-off relation to discuss the spacetime uncertainty relation concerning the operational meaning of the microscopic structure of spacetime. In addition, we derive another trade-off inequality between the measurement time and the strength of interaction between the system and the apparatus. (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)

コーシーとワイエルシュトラスによって構築されたε‐σ論法を論理学の基礎から解説。.

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)

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)

ABSTRACT This paper explores how specific Mahāyāna ethics, namely the interpretation of the Lotus Sūtra by Zhiyi (536–597), Nichiren (1222–1282) and Sōka Gakkai (1930–), can relate to core principles of international humanitarian law (IHL). In particular, it also assesses and discusses how Sōka Gakkai’s three key doctrines (the dignity of life, the variability of life and the interconnectedness of life) are congruent with some IHL principles. The paper then analyses how Buddhist organisations today can be advocates of IHL and specifically (...) looks at how Sōka Gakkai agrees with – and commits to – IHL in terms of the humanitarian impact of the use of nuclear weapons. (shrink)

Dienes & Perner's analysis provides a clear theoretical justification for using a demonstration of volitional control as a criterion for conscious awareness. However, in memory tasks, the converse does not hold: A phenomenological awareness of a memory episode can arise involuntarily, even when the task does not require retrieval of the episode. The varying amounts of volitional retrieval required by different memory tasks need to be recognized.

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.

As most work on flower foraging focuses on bees, studying Lepidoptera can offer fresh perspectives on how sensory capabilities shape the interaction between flowers and insects. Through a combination of innate preferences and learning, many Lepidoptera persistently visit particular flower species. Butterflies tend to rely on their highly developed sense of colour to locate rewarding flowers, while moths have evolved sophisticated olfactory systems towards the same end. However, these modalities can interact in complex ways; for instance, butterflies’ colour preference can (...) shift depending on olfactory context. The mechanisms by which such cross‐modal interaction occurs are poorly understood, but the mushroom bodies appear to play a central role. Because of the diversity seen within Lepidoptera in terms of their sensory capabilities and the nature of their relationships with flowers, they represent a fruitful avenue for comparative studies to shed light on the co‐evolution of flowers and flower‐visiting insects. (shrink)

This paper reports our research efforts on social robots that recognize interpersonal relationships. These investigations are carried out by observing group behaviors while the robot interacts with people. Our humanoid robot interacts with children by speaking and making various gestures. It identifies individual children by using a wireless tag system, which helps to promote interaction such as the robot calling a child by name. Accordingly, the robot is capable of interacting with many children, causing spontaneous group behavior from the children (...) around it. Here, group behavior is associated with social relationships among the children themselves. For example, a child may be accompanied by his or her friends and then play together with them. We propose the hypothesis that our interactive robot prompts a child’s friends to accompany him or her; thus, we can estimate their friendship by simply observing their accompanying behaviors. We conducted a field experiment for two weeks in a Japanese elementary school to verify this hypothesis. In the experiment, two “Robovie” robots were placed where children could freely interact with them during recesses. As a result, we found that they mostly prompted friend-accompanying behavior. Moreover, we could estimate some of their friendly relationships, in particular among the children who often appeared around the robot. For example, we could estimate 5% of all friendships with 80% accuracy, and 15% of them with nearly 50% accuracy. Thus, this result basically supports our hypothesis on friendship estimation from an interactive humanoid robot. We believe that this ability to estimate human relationships is essential for robots to behave socially. (shrink)

In this article, we examine philosophy of sport as a field of study in Japan, its history, characteristics, and future prospects, as part of a contribution to the international development of the discipline of sport philosophy. The Japan Society for the Philosophy of Sport and Physical Education has been holding an annual sport philosophy conference every year since its inception in 1978. Nevertheless, the trends of sport philosophy in Japan have not been conveyed abroad. The language barrier between Japanese and (...) English as an international communication tool makes it difficult to spread our work on the philosophy of sport throughout the world. The question arises as to whether the philosophy of sport in Japan has the same trends as those in the Western countries. Is it reasonable to assume that it has different aspects and interests than philosophy of sport in English-speaking countries? We will also try to address these questions for our audience. (shrink)

My title question as it stands is ambiguous, and is in want of some initial clarification. Does the question ask how the explanandum is logically related to the explanans? Or does it ask about the details of the dynamics of the explanation speech-act? Or does it ask how the linguistic ambiguities of explanation questions and answers should properly be unpacked? Or does it ask yet some other question? The ways of studying explanation, like the ways of understanding the world, are (...) many and varied. By this, I mean more than that the phenomenon of explanation can be studied as it arises in the different disciplines of biology, physics, the social sciences, and the like. Rather, I mean that there are varied disciplines of explanation-study itself. For example, the Hempelian tradition has largely focused on the logic of explanation, and others have focused on the linguistic, psychological, social, and epistemological angles of explanation. Thus, it is not appropriate for me to begin by arguing that explanation is a set of logically related statements or a speech-act , but appropriate instead to begin by specifying the explanatory discipline within which I ask my title question. (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}$.