The Y‐box‐binding protein (YB‐1) represents the most evolutionary conserved nucleic‐acid‐binding protein currently known. YB‐1 is a member of the cold‐shock domain (CSD) protein superfamily. It performs a wide variety of cellular functions, including transcriptional regulation, translational regulation, DNA repair, drug resistance and stress responses to extracellular signals. As a result, YB‐1 expression is closely associated with cell proliferation. In this review, we will begin by briefly describing the characteristics of YB‐1 and will then summarize the pleiotropic functions brought about via (...) DNA–RNA transaction and protein–protein interactions. In addition, we will discuss the diverse range of potential physiological and pathological functions of YB‐1. BioEssays 25:691–698, 2003. © 2003 Wiley Periodicals, Inc. (shrink)

On April 5 2000, the Diet elected Yoshiro Mori as Japan's 55th prime minister. His predecessor, Keizo Obuchi, had suffered a stroke and became unable to carry out his official responsibility. Mori, who was the former Secretary General of the ruling Liberal Democratic Party (LDP), inherited the three party coalition between the LDP, the new Komei Party and the Conservative Party, and reappointed all of Obuchi's cabinet members. Yohei Kono was reposted as the Minister of Foreign Affairs; Hideo Usui as (...) Justice; Kiichi Miyazawa as Finance; Hirofumi Nakasone as Education, Science and Technology; Yuya Niwa as Health and Welfare; Tokuichiro Tanazawa as Agriculture, Forestry and Fisheries; Takeshi Fukaya as International Trade and Industry; Toshihiro Nikai as Transport; Eita Yashiro as Posts and Telecommunications; Takamori Makino as Labor; Masaaki Nakayama as Construction; Kosuke Hori as Home Affairs, Mikio Aoki as Chief Cabinet Secretary; Kunihiro Tsuzuki as Management and Coordination; Tsutomu Kawara as Defense; Taichi Sakaiya as Economic Planning; Kayoko Shimizu as environment; and Sadakazu Tanigaki as Financial Reconstruction. (shrink)

Political developments in Japan from the latter part of 2000 to the year 2001 were highlighted by the executive transition from unpopular Yoshiro Mori to exceptionally popular Junichiro Koizumu as the nation's leader.

From the latter half of 2001 to the middle of 2002, prime minister Junichiro Koizumi was plagued by a series of scandals and administrative mishandlings, which led to some important executive turnovers. Although Koizumi has thus far upheld his principle of for the sake of policy stability, his campaign promise not to reshuffle cabinet has already been compromised somewhat, and is likely to be abandoned entirely in the near future.

Despite the tendency to be otherwise, some non-classical logics are known to validate formulas that are invalid in classical logic. A subclass of such systems even possesses pairs of a formula and its negation as theorems, without becoming trivial. How should these provable contradictions be understood? The present paper aims to shed light on aspects of this phenomenon by taking as samples the constructive connexive logic C, which is obtained by a simple modification of a system of constructible falsity, namely (...) N4, as well as its non-constructive extension C3. For these systems, various observations concerning provable contradictions are made, using mainly a proof-theoretic approach. The topics covered in this paper include: how new contradictions are found from parts of provable contradictions; how to characterise provable contradictions in C3 that are constructive; how contradictions can be seen from the relative viewpoint of strong implication; and as an appendix an attempt at generating provable contradictions in C3. (shrink)

Strong negation is a well-known alternative to the standard negation in intuitionistic logic. It is defined virtually by giving falsity conditions to each of the connectives. Among these, the falsity condition for implication appears to unnecessarily deviate from the standard negation. In this paper, we introduce a slight modification to strong negation, and observe its comparative advantages over the original notion. In addition, we consider the paraconsistent variants of our modification, and study their relationship with non-constructive principles and connexivity.

Aversive memories have the potential to impair one’s psychological well-being. It is desirable to reduce the anguish over such memories, as well as the chance that they will be retrieved. In two experiments, we investigated whether retrieval stopping reduces the distress elicited by negative memories retrieved from cues and how the effects of retrieval stopping are modulated by mental disorders, such as depression and anxiety. Participants engaged in retrieval stopping of aversive scene memories without any diversionary thoughts (direct suppression, Experiment (...) 1) or with diversionary positive thoughts (thought substitution, Experiment 2). Direct suppression reduced arousal elicited by the retrieval of aversive memories, while thought substitution did not only reduce arousal but also increased positive valence. Self-reported anxious/depressive symptoms negatively modulated the effects of direct suppression. For no or mild anxious/depressed individuals, direct suppression alleviated negative valence and high arousal when retrieving aversive memories. The negative relationship was not observed between the severity of the symptoms and the effect of thought substitution. These findings suggest that both retrieval stopping strategies can reduce distress from aversive memories. (shrink)

Intuitionistic logic formalises the foundational ideas of L.E.J. Brouwer’s mathematical programme of intuitionism. It is one of the earliest non-classical logics, and the difference between classical and intuitionistic logic may be interpreted to lie in the law of the excluded middle, which asserts that either a proposition is true or its negation is true. This principle is deemed unacceptable from the constructive point of view, in whose understanding the law means that there is an effective procedure to determine the truth (...) of all propositions. This understanding of the distinction between the two logics supports the view that negation plays a vital role in the formulation of intuitionistic logic.Nonetheless, the formalisation of negation in intuitionistic logic has not been universally accepted, and many alternative accounts of negation have been proposed. Some seek to weaken or strengthen the negation, and others actively supporting negative inferences that are impossible with it.This thesis follows this tradition and investigates various aspects of negation in intuitionistic logic. Firstly, we look at a problem proposed by H. Ishihara, which asks how effectively one can conserve the deducibility of classical theorems into intuitionistic logic, by assuming atomic classes of non-constructive principles. The classes given in this section improve a previous class given by K. Ishii in two respects: (a) instead of a single class for the law of the excluded middle, two classes are given in terms of weaker principles, allowing a finer analysis and (b) the conservation now extends to a subsystem of intuitionistic logic called Glivenko’s logic. This section also discusses the extension of Ishihara’s problem to minimal logic.Secondly, we study the relationship between two frameworks for weak constructive negation, the approach of D. Vakarelov on one hand and the framework of subminimal negation by A. Colacito, D. de Jongh, and A. L. Vargas on the other hand. We capture a version of Vakarelov’s logic with the semantics of the latter framework, and clarify the relationship between the two semantics. This also provides proof-theoretic insights, which results in the formulation of a cut-free sequent calculus for the aforementioned system.Thirdly, we investigate the ways to unify the formalisations of some logics with contra-intuitionistic inferences. The enquiry concerns paraconsistent logics by R. Sylvan and A. B. Gordienko, as well as the logic of co-negation by G. Priest and of empirical negation by M. De and H. Omori. We take Sylvan’s system as basic, and formulate the frame conditions of the defining axioms of the other systems. The conditions are then used to obtain cut-free labelled sequent calculi for the systems.Finally, we consider L. Humberstone’s actuality operator for intuitionistic logic, which can be seen as the dualisation of a contra-intuitionistic negation. A compete axiomatisation of intuitionistic logic with actuality operator is given, and comparisons are made for some related operators.Abstract prepared by Satoru Niki.E-mail:Satoru.Niki@rub.de. (shrink)

H. Omori and H. Wansing introduced in a recent paper possible alternatives for the negation of the logic of first-degree entailment. One of their observations with regard to these alternative negations is that some of them turn out to induce negation inconsistency, meaning that some contradictions become provable (under an arbitrary premise) when used in place of the original negation. Omori and Wansing also considered a non-deterministic generalisation of such operators, but it was left open whether the generalised negation similarly (...) induces negation inconsistency. In this paper, we provide an answer to this question in the positive, and moreover look into further generalisation and characterisation of non-deterministic operators which satisfy the formal criteria of negation inconsistency and its pair notion of negation incompleteness in the setting of Omori and Wansing. (shrink)

We investigate the relationship between M. De's empirical negation in Kripke and Beth Semantics. It turns out empirical negation, as well as co-negation, corresponds to different logics under different semantics. We then establish the relationship between logics related to these negations under unified syntax and semantics based on R. Sylvan's CCω.

We investigate a subsystem of minimal logic related to D. Vakarelov’s logic \, using the framework of subminimal logics by A. Colacito, D. de Jongh and A. L. Vargas. In the course of it, the relationship between the two semantics in the respective frameworks is clarified. In addition, we introduce a sequent calculus for the investigated subsystem, and some proof-theoretic properties are established. Lastly, we formulate a new infinite class of subsystems of minimal logics.

N. Kamide introduced a pair of classical and constructive logics, each with a peculiar type of negation: its double negation behaves as classical and intuitionistic negation, respectively. A consequence of this is that the systems prove contradictions but are non-trivial. The present paper aims at giving insights into this phenomenon by investigating subsystems of Kamide’s logics, with a focus on a system in which the double negation behaves as the negation of minimal logic. We establish the negation inconsistency of the (...) system and embeddability of contradictions from other systems. In addition, we attempt at an informational interpretation of the negation using the dimathematical framework of H. Wansing. (shrink)

Five major claims are made in our paper on strategic voting within the context of Japan's multimember single non-transferable vote (SNTV) electoral system (Fournier and Kohno, 2000). Two claims deal with the reconciliation of Steven Reed's (1990) and Gary Cox's (1997) important work on extending Duverger's law to the Japanese case, and three claims deal with the informational effects of partisan labels on strategic voting.

Eukaryotic genome DNA is wrapped around core histones and forms a nucleosome structure. Together with associated proteins and RNAs, these nucleosomes are organized three‐dimensionally in the cell as chromatin. Emerging evidence demonstrates that chromatin consists of rather irregular and variable nucleosome arrangements without the regular fiber structure and that its dynamic behavior plays a critical role in regulating various genome functions. Single‐nucleosome imaging is a promising method to investigate chromatin behavior in living cells. It reveals local chromatin motion, which reflects (...) chromatin organization not observed in chemically fixed cells. The motion data is like a gold mine. Data analyses from many aspects bring us more and more information that contributes to better understanding of genome functions. In this review article, we describe imaging of single‐nucleosomes and their tracked behavior through oblique illumination microscopy. We also discuss applications of this technique, especially in elucidating nucleolar organization in living cells. (shrink)

S-Modulin is a frog homolog of recoverin. The function and the underlying mechanism of the action of these proteins are now understood in general. However, there remain some unsolved issues including; two distinct effects of S-modulin; Ca2+-dependent binding of S-modulin to membranes and a possible target protein; S-modulin-like proteins in other neurons. These issues are considered in this commentary.

In dieser Abhandlung versuchen wir die Theorie des Erhabenen bei Kant als eine Logik der reflektierenden Urteilskraft darzustellen, die den Ubergang des Sinnlichen ins Ubersinnliche ermoglicht. Die Urteilskraft bezieht die Spannung der Einbildungskraft vor dem Nicht-Darstellbaren auf das Ubersinnliche, und in dieser Beziehung sieht Kant "eine a priori im Subjekte liegende Zweckmassigkeit". Durch die Vorstellung der gewaltigen Natur kann unsere innere Idee erweckt werden, wenn wir berucksichtigen, "dass auf jene moralischen Anlagen bei jeder schicklichen Veranlassung Rucksicht genommen werden sollte". Durch (...) das Urteil uber das Erhabene erhalten wir eine Veranlassung fur diejenige Reflexion, die innerhalb der Natur auch die ubersinnliche Idee (oder ein gottliches Wesen) denkt. (edited). (shrink)

We show that length initial submodels of S12 can be extended to a model of weak second order arithmetic. As a corollary we show that the theory of length induction for polynomially bounded second order existential formulae cannot define the function division.

We define a theory of two-sort bounded arithmetic whose provably total functions are exactly those in ${\mathcal{F}_{LOGCFL}}$ by way of a generalized quantifier that expresses computations of SAC 1 circuits. The proof depends on Kolokolova’s conditions for the connection between the provable capture in two-sort theories and descriptive complexity.

We define a fragment of Primitive Recursive Arithmetic by replacing the defining axioms for primitive recursive functions by those for functions in some specific complexity class. In this note we consider such theory for AC0. We present a model-theoretical property of this theory, by means of which we are able to characterize its provably total functions. Next we consider the problem of how strong the induction scheme can be in this theory.

We will give a two-sort system which axiomatizes winning strategies for the combinatorial game Node Kayles. It is shown that our system captures alternating polynomial time reasonings in the sense that the provably total functions of the theory corresponds to those computable in APTIME. We will also show that our system is equivalently axiomatized by Sprague–Grundy theorem which states that any Node Kayles position is provably equivalent to some NIM heap.

Ishihara's problem of decidable variables asks which class of decidable propositional variables is sufficient to warrant classical theorems in intuitionistic logic. We present several refinements to the class proposed by Ishii for this problem, which also allows the class to cover Glivenko's logic. We also treat the extension of the problem to minimal logic, suggesting a couple of new classes.

We continue the investigation of the first paper where we studied logics with various negations including empirical negation and co-negation. We established how such logics can be treated uniformly with R. Sylvan's CCω as the basis. In this paper we use this result to obtain cut-free labelled sequent calculi for the logics.

It is an unusual property for a logic to prove a formula and its negation without ending up in triviality. Some systems have nonetheless been observed to satisfy this property: one group of such non-trivial negation inconsistent logics has its archetype in H. Wansing’s constructive connexive logic, whose negation-implication fragment already proves contradictions. N. Francez and Y. Weiss subsequently investigated relevant subsystems of this fragment, and Weiss in particular showed that they remain negation inconsistent. In this note, we take a (...) closer look at this phenomenon in the systems of Francez and Weiss, and point out two types of necessary conditions, one proof-theoretic and one relevant, which any contradictory formula must satisfy. As a consequence, we propose a nine-fold classification of provable contradictions for the logics. (shrink)

日本の固有の宗教神道より説き起こし、日本の仏教、歌人・念仏者・茶人・武人・医者・妙好人・禅僧・真宗僧侶・作家・俳人と多種な人間像を通して、日本人の生き生きとした生命の躍動感を解き明かす。.

We prove in the framework of Bishop's constructive mathematics that the sequential completion equation image of the space [MATHEMATICAL SCRIPT CAPITAL D] is filter-complete. Then it follows as a corollary that the filter-completeness of [MATHEMATICAL SCRIPT CAPITAL D] is equivalent to the principle BD-ℕ, which can be proved in classical mathematics, Brouwer's intuitionistic mathematics and constructive recursive mathematics of Markov's school, but does not in Bishop's constructive mathematics. We also show that equation image is identical with the filter-completion which was (...) provided by Bishop. (shrink)

Since the early 1990s, Steven Reed and Gary Cox have changed our understanding of Japan's multimember SNTV electoral system, by highlighting its institutional effects similar to what is known as Duverger's law in the Anglo-American context. While we offer some additional evidence to consolidate their findings, we also address an issue left unexplored in these studies, namely the role of partisan information. Under Japan's system, party labels matter in elections. We show that, while Japanese voters are generally willing to abandon (...) the candidates without affiliation with established parties, the partisan effects produce constraints for strategic coordination. (shrink)

Honey bees are eusocial insects and the workers inform their nestmates of information regarding the location of food source using symbolic communication, called ‘dance communication’, that are based on their highly advanced learning abilities. Mushroom bodies (MBs), a higher-order center in the honey bee brain, comprise some subtypes/populations of interneurons termed Kenyon cells (KCs) that are distinguished by their cell body size and location in the MBs, as well as their gene expression profiles. Although the role of MBs in learning (...) ability has been studied extensively in the honey bee, the roles of each KC subtype and their evolution in hymenopteran insects remain mostly unknown. This mini-review describes recent progress in the analysis of gene/protein expression profiles and possible functions of KC subtypes/populations in the honey bee. Especially, the discovery of novel KC subtype/population, ‘middle-type KCs’ and ‘KC population expressing FoxP’, necessitated a redefinition of the KC subtype/population. Analysis of the effects of inhibiting gene function in a KC subtype-preferential manner revealed the function of the gene product as well as of the subtype where it is expressed. Genes expressed in a KC subtype/population-preferential manner can be used to trace the differentiation of KC subtypes during the honey bee ontogeny and the possible evolution of KC subtypes in hymenopteran insects. Current findings suggest that the three KC subtypes are unique characteristics to the aculeate hymenopteran insects. Finally, recent application of genome editing for the study of KC subtype functions in the honey bee is described. Genes expressed in a KC subtype-preferential manner can be good candidate target genes for genome editing, because they are likely related to highly advanced brain functions and some of them are dispensable for normal development and sexual maturation in honey bees. (shrink)

We show, within the framework of Bishop's constructive mathematics, that (sequential) completeness of the locally convex space $\mathcal{D} (\mathbb{R})$ of test functions is equivalent to the principle BD-N which holds in classical mathemtatics, Brouwer's intuitionism and Markov's constructive recursive mathematics, but does not hold in Bishop's constructivism.

Topics in Cognitive Science, Volume 14, Issue 2, Page 241-257, April 2022.

Phenomenology of the body and the third generation of cognitive science, both of which attribute a central role in human cognition to the body rather than to the Cartesian notion of representation, face the criticism that higher-level cognition cannot be fully grasped by those studies. The problem here is how explicit representations, consciousness, and thoughts issue from perception and the body, and how they cooperate in human cognition. In order to address this problem, we propose a research program, a cognitive (...) phenomenology of the body, which is basically motivated by the perspective of Merleau-Ponty. We find a substantial clue in developmental psychological studies on the body and language. (shrink)

This paper tests the hypotheses that the tide of globalization undermines or reinforces the traditional types of social capital. Using the 2006 AsiaBarometer Survey data and applying two-level logit regression analysis, this paper found that social capital related to sense of trust or human nature and interpersonal relations can be augmented by globalization, while social capital regarding familialism and mindfulness can be weakened.