慶応義塾大学法学部のゼミナール「伊東乾民事訴訟法研究会」の卒業生の会「乾会」による論文集。今回はテーマを民事訴訟法に限ることなく、現在関心を持っている法律分野について執筆した。.

Reinforcement learning is very effective for robot learning. Because it does not need priori knowledge and has higher capability of reactive and adaptive behaviors. In our previous works, we proposed new reinforcement learning algorithm: “Q-learning with Dynamic Structuring of Exploration Space Based on Genetic Algorithm (QDSEGA)”. It is designed for complicated systems with large action-state space like a robot with many redundant degrees of freedom. And we applied it to 50 link manipulator and effective behavior is acquired. However optimality and (...) fault tolerance of the proposed algorithm were not considered and to demonstrate effectiveness of the proposed algorithm other applications are necessary. Acquiring of locomotion patterns by a multi-legged robot is a very interesting problem. As it has many redundant degrees of freedom, application of usual reinforcement learning is difficult and an optimal locomotion has not been acquired using previous reinforcement learning algorithm. And the redundancy of the robot is effective to the fault tolerance and various locomotion patterns can be acquired for adapting the faults of the legs. In this paper, we applied QDSEGA to acquiring of locomotion pattern by the multi-legged robot and considered the optimality and fault tolerance. Effective behavior has been obtained by using our proposed algorithm. (shrink)

Reinforcement learning has recently received much attention as a learning method for complicated systems, e.g., robot systems. It does not need prior knowledge and has higher capability of reactive and adaptive behaviors. However increase in dimensionality of the action-state space makes it diffcult to accomplish learning. The applicability of the existing reinforcement learning algorithms are effective for simple tasks with relatively small action-state space. In this paper, we propose a new reinforcement learning algorithm: “Q-learning with Dynamic Structuring of Exploration Space (...) Based on Genetic Algorithm ”. The algorithm is applicable to systems with high dimensional action and interior state spaces, for example a robot with many redundant degrees of freedom. To demonstrate the effectiveness of the proposed algorithm simulations of obstacle avoidance by a 50 links manipulator have been carried out. It is shown that effective behavior can be learned by using the proposed algorithm. (shrink)

One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn’s discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, (...) which gives us intuitive readings of connectives, out of truth tables. Then, we revisit the notion of functional completeness, which is one of the key notions in many-valued logic, in view of Dunn’s idea. More concretely, we introduce a generalized notion of functional completeness which naturally arises in the spirit of Dunn’s idea, and prove some fundamental results corresponding to the classical results proved by Post and Słupecki. (shrink)

Genome maintenance requires various nucleoid-associated factors in prokaryotes. Among them, the SMC protein has been thought to play a static role in the organization and segregation of the chromosome during cell division. However, recent studies have shown that the bacterial SMC is required to align left and right arms of the emerging chromosome and that the protein dynamically travels from origin to Ter region. A rod form of the SMC complex mediates DNA bridging and has been recognized as a machinery (...) responsible for DNA loop extrusion, like eukaryotic condensin or cohesin complexes, which act as chromosome organizers. Attention is now turning to how the prototype of the complex is loaded on the entry site and translocated on chromosomal DNA, explaining its overall conformational changes at atomic levels. Here, we review and highlight recent findings concerning the prokaryotic SMC complex and discuss possible mechanisms from the viewpoint of protein architecture. Recent studies show dynamic movements of the prokaryotic SMC protein complex: initial loading, translocation on DNA for bacterial chromosome organization. The recent structural models of the protein also provide a new vision for the structure-function relationship. (shrink)

The purpose of this paper is to argue that the hybrid formalism fits naturally in the context of David Lewis’s counterfactual logic and that its introduction into this framework is desirable. This hybridization enables us to regard the inference “The pig is Mary; Mary is pregnant; therefore the pig is pregnant” as a process of updating local information (which depends on the given situation) by using global information (independent of the situation). Our hybridization also has the following technical advantages: (i) (...) it preserves the completeness and decidability of Lewis’s logic; (ii) it allows us to characterize the Limit Assumption as a proof-rule with some side-conditions; and (iii) it enables us to establish a general Kripke completeness result by using the proof-rule corresponding to the Limit Assumption. Keywords Counterfactual logic - David Lewis - Contextually definite description - Hybrid logic - Arthur Prior - The limit assumption - Strong completeness - Decidability - Bisimulation - Pure completeness. (shrink)

This paper deals with two main topics: One is a semantical investigation for a bimodal language with a modal operator \blacksquare associated with the intersection of the accessibility relation R and the inequality ≠. The other is a generalization of some of the former results to general extended languages with modal operators. First, for our language L\sb{\square\blacksquare}, we prove that Segerberg's theorem (equivalence between finite frame property and finite model property) fails and establish both van Benthem-style and Goldblatt-Thomason-style characterizations. We (...) extract the notion of \blacksquare-realizer (a generalization of bulldozing) as an essence from the proofs of our results. Second, we generalize the notion of \blacksquare-realizer and prove quite general versions of these semantical characterization results. The known and previously unknown characterization results for almost all of the languages extended with modal operators already proposed will be immediate corollaries. (shrink)

正しいから証明できるのか、証明できるから正しいのか。数学にとって証明とは何か、正しさとは何なのかは数学基礎論の根本的な問題である。様相論理を軸とした、証明と真理に関わる数学基礎論の古典的な結果から最先 端の議論までを解説した。.

We develop intuitionistic public announcement logic over intuitionistic \({\textbf{K}}\), \({{\textbf{K}}}{{\textbf{T}}}\), \({{\textbf{K}}}{{\textbf{4}}}\), and \({{\textbf{S}}}{{\textbf{4}}}\) with distributed knowledge. We reveal that a recursion axiom for the distributed knowledge is _not_ valid for a frame class discussed in [ 12 ] but valid for the restricted frame class introduced in [ 20, 26 ]. The semantic completeness of the static logics for this restricted frame class is established via the concept of pseudo-model.

Drawing on theories of institutional evolution, this article contends that despite the centrality of occupationally based social insurance in postwar Korea and Taiwan, the welfare state has in fact deepened considerably. The analysis is structured around three distinct eras of social policy reform in Korea and Taiwan: the developmental state, democratic transition, and postindustrialism. The authors contend that during each of these eras, the institutional purposes of social policy were altered to meet certain socioeconomic objectives. New institutional purposes were grafted (...) onto the prevailing social insurance model, changing the outcomes of social policy. The developmental state era was productivist in purpose, democratic reform during the 1980s reoriented social insurance toward universalist and redistributive principles, and the post-1997 era refocused social insurance to meet the imperatives of flexible labor markets, demographic shifts, and economic globalization. (shrink)

Intelligent humanoid robots (IHRs) are becoming likely to be integrated into nursing practice. However, a proper integration of IHRs requires a detailed description and explanation of their essential capabilities, particularly regarding their competencies in replicating and portraying emotive functions such as empathy. Existing humanoid robots can exhibit rudimentary forms of empathy; as these machines slowly become commonplace in healthcare settings, they will be expected to express empathy as a natural function, rather than merely to portray artificial empathy as a replication (...) of human empathy. This article works with a twofold purpose: firstly, to consider the impact of artificial empathy in nursing and, secondly, to describe the influence of Affective Developmental Robotics (ADR) in anticipation of the empathic behaviour presented by artificial humanoid robots. The ADR has demonstrated that it can be one means by which humanoid nurse robots can achieve expressions of more relatable artificial empathy. This will be one of the vital models for intelligent humanoid robots currently in nurse robot development for the healthcare industry. A discussion of IHRs demonstrating artificial empathy is critical to nursing practice today, particularly in healthcare settings dense with technology. (shrink)

This paper studies a combined system of intuitionistic and classical propositional logic from proof-theoretic viewpoints. Based on the semantic treatment of Humberstone (J Philos Log 8:171–196, 1979) and del Cerro and Herzig (Frontiers of combining systems: FroCoS, Springer, 1996), a sequent calculus $$\textsf{G}(\textbf{C}+\textbf{J})$$ is proposed. An approximate idea of obtaining $$\textsf{G}(\textbf{C}+\textbf{J})$$ is adding rules for classical implication on top of the intuitionistic multi-succedent sequent calculus by Maehara (Nagoya Math J 7:45–64, 1954). However, in the semantic treatment, some formulas do not (...) satisfy heredity, which leads to the necessity of a restriction on the right rule for intuitionistic implication to keep the soundness of the calculus. The calculus $$\textsf{G}(\textbf{C}+\textbf{J})$$ enjoys cut elimination and Craig interpolation, whose detailed proofs are described in this paper. Cut elimination enables us to show the decidability of this combination both directly and syntactically. This paper also employs a canonical model argument to establish the strong completeness of Hilbert system $$\mathbf {C+J}$$ proposed by del Cerro and Herzig (Frontiers of combining systems: FroCoS, Springer, 1996). (shrink)

Die neuere Naturwissenschaft trat im 17. Jahrhundert zuerst als “Physik” auf. Man soll sich an die Gründung der modernen Dynamik von Galileo und Newton erinnern.Die methodisch-allgemeine Grundlegung dieser neuen Wissenschaft wird in der Cartesischen Philosophie am klarsten ausgedrückt.

The inositol phosphate metabolism network has been found to be much more complex than previously thought, as more and more inositol phosphates and their metabolizing enzymes have been discovered. Some of the inositol phosphates have been shown to have biological activities, but little is known about their signal transduction mechanisms except for that of inositol 1,4,5‐trisphosphate. The recent discovery, however, of a number of binding proteins for inositol high polyphosphate [inositol 1,3,4,5‐tetrakisphosphate (IP4), inositol 1,3,4,5,6‐pentakisphosphate, or inositol hexakisphosphate] enables us to (...) speculate on the physiological function of these compounds. In this article we focus on two major issues: (1) the roles of inositol high polyphosphates in vesicular trafficking, especially exocytosis, and (2) pleckstrin homology domaincontaining IP4 binding proteins involved in the Ras signaling pathway. (shrink)

The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by the idea of an auxiliary semantics studied by van Benthem and Wang et al. A key insight of our auxiliary semantics for dynamic logic of relation changers can be described as: “relation changers are bounded morphisms.” Moreover, we demonstrate that this semantic insight can be used to provide a modular cut-free labelled (...) sequent calculus for the logic in the sense that our calculus can be regarded as a natural expansion of a labelled sequent calculus of iteration-free propositional dynamic logic. (shrink)