To preserve postoperative brain function, it is important for neurosurgeons to fully understand the brain's structure, vasculature, and function. Intraoperative high-frequency electrical stimulation during awake craniotomy is the gold standard for mapping the function of the cortices and white matter; however, this method can only map the “focal” functions and cannot monitor large-scale cortical networks in real-time. Recently, an in vivo electrophysiological method using cortico-cortical evoked potentials induced by single-pulse electrical cortical stimulation has been developed in an extraoperative setting. By (...) using the CCEP connectivity pattern intraoperatively, mapping and real-time monitoring of the dorsal language pathway is available. This intraoperative CCEP method also allows for mapping of the frontal aslant tract, another language pathway, and detection of connectivity between the primary and supplementary motor areas in the frontal lobe network. Intraoperative CCEP mapping has also demonstrated connectivity between the frontal and temporal lobes, likely via the ventral language pathway. Establishing intraoperative electrophysiological monitoring is clinically useful for preserving brain function, even under general anesthesia. This CCEP technique demonstrates potential clinical applications for mapping and monitoring large-scale cortical networks. (shrink)

Within a weak subsystem of second-order arithmetic , that is -conservative over , we reformulate Kreisel's proof of the Second Incompleteness Theorem and Boolos' proof of the First Incompleteness Theorem.

専門的な予備知識は仮定せずに完全性定理や計算可能性から論じ、第一および第二不完全性定理、Rosserの定理、Hilbertのプログラム、G ̈odelの加速定理、算術の超準モデル、Kolmogorov複雑性などを紹介して、不完全性定理の数学的意義と、その根源にある哲学的問題を説く。.

明治時代、人々は狐憑きやコックリさんなどの怪現象に右往左往していた。若き哲学者の井上圓了は、それらに合理的な道筋をつけることこそが哲学普及につながると信じて奔走。柳田國男からは見地の違いから「井上圓了 君には徹頭徹尾反対」と言われながらも、開学した「哲学館」(現東洋大学)で「妖怪学」の講義を行い、日本各地で膨大な怪異談を収集した。妖怪学者であり、哲学者、宗教改革者であった隠れた偉人、初の評伝。.

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

In this note we show that groups with definable generics in a separably closed valued field K of finite imperfection degree can be embedded into groups definable in the algebraic closure of K.

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

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.

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)

Recently, Edwards and Liaschenko questioned the validity of an argument put forward by Dr Søren Holm and Joseph Dunne concerning the impossibility of a theory of nursing. Taking into consideration the premises of the argument, I describe how Maritain's conception of philosophy allows for the possibility of a theory of nursing conceived as a philosophy of nursing art that is both practical and propositional in nature. As well, I identify how the philosophy of nursing art guides nursing art in developing (...) and applying other kinds of artistic practical nursing knowledge: artistic nursing rules and artistic prudential nursing judgements. Finally, the relationship of ethical knowledge to artistic practical nursing knowledge is set down. (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)

Recently, a concern has been raised about a particular kind of behaviour that is adversely affecting the quality of nursing theoretical discourse. With the behaviour being attributed to nurses’ tendency to think in binary terms, it has been proposed that nurses replace their binary way of thinking with thinking that is inclusive and expansive and is based on an epistemology of contradiction. While agreeing that the behaviour of concern is indeed unscholarly, I disagree that the culprit is the binary. In (...) this commentary, I argue that the culprit is sophistical argumentation involving a binary (real or not) and that, by not making room for legitimate binaries, we run the danger of ‘throwing out the baby with the bathwater’. Further, I argue that the proffered solution is illusory. Its epistemological basis prohibits the deliverance of that which is promised. (shrink)

This paper introduces sequent systems for Visser's two propositional logics: Basic Propositional Logic (BPL) and Formal Propositional Logic (FPL). It is shown through semantical completeness that the cut rule is admissible in each system. The relationships with Hilbert-style axiomatizations and with other sequent formulations are discussed. The cut-elimination theorems are also demonstrated by syntactical methods.

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}$.

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)

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)

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)

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.

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)

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)

We propose that observables in quantum theory are properly understood as representatives of symmetry-invariant quantities relating one system to another, the latter to be called a reference system. We provide a rigorous mathematical language to introduce and study quantum reference systems, showing that the orthodox “absolute” quantities are good representatives of observable relative quantities if the reference state is suitably localised. We use this relational formalism to critique the literature on the relationship between reference frames and superselection rules, settling a (...) long-standing debate on the subject. (shrink)

By formalizing Berry's paradox, Vopěnka, Chaitin, Boolos and others proved the incompleteness theorems without using the diagonal argument. In this paper, we shall examine these proofs closely and show their relationships. Firstly, we shall show that we can use the diagonal argument for proofs of the incompleteness theorems based on Berry's paradox. Then, we shall show that an extension of Boolos' proof can be considered as a special case of Chaitin's proof by defining a suitable Kolmogorov complexity. We shall show (...) also that Vopěnka's proof can be reformulated in arithmetic by using the arithmetized completeness theorem. (shrink)

We give a proof of Gödel's first incompleteness theorem based on Berry's paradox, and from it we also derive the second incompleteness theorem model-theoretically.

Floridi’s infosphere consisting of informational reality is estimated and delineated by introducing the new notion of Typ-Ken, an undifferentiated amalgam of type and token that can be expressed as either type or token dependent on contingent ontological commitment. First, we elaborate Floridi’s system, level of abstraction (LoA), model, and structure scheme, which is proposed to reconcile ontic with epistemic structural reality, and obtain the duality of type and token inherited in the relationship between LoA and model. While we focus on (...) the ontological commitment that can negotiate and emphasize the discrepancy between type and token, we show that most research focusing on different hierarchical layers (type and token) has converged onto the flattened perspective of type and token to clarify the role of ontological commitment. We propose the idea of Typ-Ken to avoid this flattening. In addition, we elaborate Taddeo and Floridi’s criticism of approaches to the symbol grounding problem and show that their criticism based on the zero semantical commitment condition is specific to the agents affected by the flattening. We then take bird flocks as a metaphor for the living infosphere as if it had one mind. The knowledge recently yielded by image analysis indicates that it is difficult for previous flock models based on agents equipped with the flattening of local (token) and global (type) to show the special feature of a flock of the scale-free proportion (SFP). We show here that agents based on the Typ-Ken can reveal the SFP, which is the essential characteristic of the living infosphere. In other words, Typ-Ken is an expression for informational reality (LoA and model with ontological commitment) that can reveal seamless local and global interactions in the functioning of a flock or infosphere. (shrink)

Contents: Hōtoku gaiki -- Ninomiya Sensei goroku -- Sanshi suitō.

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

Unter dem Titel Feuerbach und der Judaismus wird mit dieser Publikation ein neues Kapitel in der Feuerbachforschung aufgeschlagen, da erstmalig Feuerbachs Stellung zum Judaismus, aber auch sein Einfluß auf die deutsch-jüdische Philosophie ...