1. Kodai shisō -- 3. Chūsei shisō -- 4. Kindai shisō -- 5. Tōzai bunka no kōryū -- 6. Shōtoku Taishi -- 7. Kinsei Nihon no hihanteki seishin -- 8. Nihon shūkyō no kindaisei.

Estrogen receptor α (ERα) is a ligand‐dependent transcription factor that regulates the expression of estrogen‐responsive genes. Approximately 70% of patients with breast cancer are ERα positive. Estrogen stimulates cancer cell proliferation and contributes to tumor progression. Endocrine therapies, which suppress the ERα signaling pathway, significantly improve the prognosis of patients with breast cancer. However, the development of de novo or acquired endocrine therapy resistance remains a barrier to breast cancer treatment. Therefore, understanding the regulatory mechanisms of ERα is essential to (...) overcome the resistance to treatment. This review focuses on the regulation of ERα expression, including copy number variation, epigenetic regulation, transcriptional regulation, and stability, as well as functions from the point of view post‐translational modifications. (shrink)

We propose a new game to strategically justify the constrained equal awards rule in claims problems. Our game is “procedurally fair” and “multilateral”. In addition, even if claimants cannot reach an agreement in any period, they can renegotiate in the next period. We show that, for each claims problem, the awards vector chosen by the constrained equal awards rule achieved at period 1 is the unique subgame perfect equilibrium outcome of the game.

Akama et al. [1] systematically studied an arithmetical hierarchy of the law of excluded middle and related principles in the context of first-order arithmetic. In that paper, they first provide a prenex normal form theorem as a justification of their semi-classical principles restricted to prenex formulas. However, there are some errors in their proof. In this paper, we provide a simple counterexample of their prenex normal form theorem [1, Theorem 2.7], then modify it in an appropriate way which still serves (...) to largely justify the arithmetical hierarchy. In addition, we characterize a variety of prenex normal form theorems by logical principles in the arithmetical hierarchy. The characterization results reveal that our prenex normal form theorems are optimal. For the characterization results, we establish a new conservation theorem on semi-classical arithmetic. The theorem generalizes a well-known fact that classical arithmetic is $\Pi _2$ -conservative over intuitionistic arithmetic. (shrink)

As Hegel suggests, there is no philosophy apart from the history of philosophy. Each philosophy represents the spirit peculiar to its own period. Heidegger, too, holds that every philosophy is the sound of Being, and the history of philosophy is the history of Being. This is true for the Kyoto School philosophy of modern Japan represented by Kitaro Nishida, Hajime Tanabe, and Tetsuro Watsuji, who made to endeavor to construct a new synthesis of Western and Eastern philosophy in the critical, (...) confrontational, and creative ways in the given historical contexts. In particular, Tanabe attempts at the dialectical unification of Christianity and Buddhism in the last resort from the standpoint of Absolute Nothingness. As, in Whitehead’s conception of process, actuality is composed of the past objective being as the given data and the present subjective act of becoming, so it might be highly significant to analyze the constitutive elements of Tanabe’s system of thought from the historical and comparative contexts. (shrink)

We systematically study several principles and give a principle which is weaker than disjunctive Markov’s principle. We also show that the principle is underivable and strictly weaker than MP∨ in certain extensions of the system EL of elementary analysis.

The essay is a written version of a talk Nakamura Yūjirō gave at the College international de philosophie in Paris in 1983. In the talk Nakamura connects the issue of common sense in his own work to that of place in Nishida Kitarō and the creative imagination in Miki Kiyoshi. He presents this connection between the notions of common sense, imagination, and place as constituting one important thread in contemporary Japanese philosophy. He begins by discussing the significance of (...) place (basho) that is being rediscovered today in response to the shortcomings of the modern Western paradigm, and discusses it in its various senses, such as ontological ground or substratum, the body, symbolic space, and linguistic or discursive topos in ancient rhetoric. He then relates this issue to the philosophy of place Nishida developed in the late 1920s, and after providing an explication of Nishida’s theory, discusses it further in light of some linguistic and psychological theories. Nakamura goes on to discuss his own interest in the notion of common sense traceable to Aristotle and its connection to the rhetorical concept of topos, and Miki’s development of the notion of the imagination in the 1930s in response to Nishida’s theory. And in doing so he ties all three—common sense, place, and imagination—together as suggestive of an alternative to the modern Cartesian standpoint of the rational subject that has constituted the traditional paradigm of the modern West. (shrink)

We provide a fine‐grained analysis on the relation between König's lemma, weak König's lemma, and the decidable fan theorem in the context of constructive reverse mathematics. In particular, we show that double negated variants of König's lemma and weak König's lemma are equivalent to double negated variants of the general decidable fan theorem and the binary decidable fan theorem, respectively, over a nearly intuitionistic system containing a weak countable choice only. This implies that the general decidable fan theorem is not (...) equivalent to the binary decidable fan theorem in the absence of a strong countable choice. In addition, we introduce a principle which fills the gap between König's lemma and weak König's lemma, and show that König's lemma is equivalent to weak König's lemma plus this principle. We also solve several problems arising from the investigation. (shrink)

1. Katachi no odissei -- 2. Rinshō no chi -- 3. Aku no tetsugaku nōto 4. Zōho 21-seiki mondaigun ; Jutsugoshū II -- 5. Shūkyō to kagaku; Jinruichi shō -- 6. Shinpen Nihon bunka ni okeru aku to tsumi ; Shōnenba -- 7. Jutsugoteki sekai to seido -- 8. Seishin no fūga -- 9. Shinpen Pasukaru to sono jidai -- 10. Shinpen kindai Nihon ni okeru seido to shisō.

We define a liar-type paradox as a consistent proposition in propositional modal logic which is obtained by attaching boxes to several subformulas of an inconsistent proposition in classical propositional logic, and show several famous paradoxes are liar-type. Then we show that we can generate a liar-type paradox from any inconsistent proposition in classical propositional logic and that undecidable sentences in arithmetic can be obtained from the existence of a liar-type paradox. We extend these results to predicate logic and discuss Yablo’s (...) Paradox in this framework. Furthermore, we define explicit and implicit self-reference in paradoxes in the incompleteness phenomena. (shrink)

While entanglement is a phenomenon discussed in quantum theory, it can also be found in art. We propose to connect entanglement to art’s most fundamental question: what is creativity? For example, Marcel Duchamp found the essence of the creative act in the “art coefficient,” the difference and/or gap between the artist’s intention and realization which is created. This paper locates the common sense understanding of entanglement in an inseparable whole that ensures difference between the intention and realization. Seeing the artistic (...) act as actively designing entanglement within artistic production, we present examples of this from the work of the Japanese-style painter Nakamura, and present a concrete vision for an answer regarding the question of the nature of creativity. (shrink)

Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a general context of first-order theories. To this end, we first formalize the standard transformation procedure for prenex normalization. Then we show that the classes $$\textrm{E}_k$$ and $$\textrm{U}_k$$ introduced in [1] are exactly the classes induced by $$\Sigma _k$$ and $$\Pi _k$$ respectively via the transformation procedure in (...) any first-order theory. (shrink)

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)

We refine the arithmetical hierarchy of various classical principles by finely investigating the derivability relations between these principles over Heyting arithmetic. We mainly investigate some restricted versions of the law of excluded middle, De Morgan's law, the double negation elimination, the collection principle and the constant domain axiom.

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf {PA}$ and intuitionistic arithmetic $\mathsf {HA}$. Using a generalized negative translation, we first provide a structured proof of the fact that $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over $\mathsf {HA} + {\Sigma _k}\text {-}\mathrm {LEM}$ where ${\Sigma _k}\text {-}\mathrm {LEM}$ is the axiom scheme of the law-of-excluded-middle restricted to formulas in $\Sigma _k$. In addition, we show that this conservation theorem is optimal in the (...) sense that for any semi-classical arithmetic T, if $\mathsf {PA}$ is $\Pi _{k+2}$ -conservative over T, then ${T}$ proves ${\Sigma _k}\text {-}\mathrm {LEM}$. In the same manner, we also characterize conservation theorems for other well-studied classes of formulas by fragments of classical axioms or rules. This reveals the entire structure of conservation theorems with respect to the arithmetical hierarchy of classical principles. (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.

没後20年、いま必要な歴史に裏打ちされた予見力、現実政治に提言する率直さ、道義性と理想主義。.

In this paper, I show that the availability of what some authors have called the weak reading and the strong reading of donkey sentences with relative clauses is systematically related to monotonicity properties of the determiner. The correlation is different from what has been observed in the literature in that it concerns not only right monotonicity, but also left monotonicity (persistence/antipersistence). I claim that the reading selected by a donkey sentence with a double monotone determiner is in fact the one (...) that validates inference based on the left monotonicity of the determiner. This accounts for the lack of strong reading in donkey sentences with MON determiners, which have been neglected in the literature. I consider the relevance of other natural forms of inference as well, but also suggest how monotonicity inference might play a central role in the actual process of interpretation. The formal theory is couched in dynamic predicate logic with generalized quantifiers. (shrink)

This paper considers methodological issues of awareness during adult second language acquisition. Specifically, the paper deals with the issue of instructional orientations, the issue of biases in knowledge measurement, and the issue of reactivity in the online think-aloud protocol. Detailed reviews of prominent SLA research that has investigated the possibility of implicit SLA reveal that the instruction on implicit learning does not guarantee that learners engage in the implicit learning mode, that the majority of SLA research has employed only tests (...) of “explicit learning” such as untimed grammaticality judgment, and that there is some evidence that the online think-aloud protocol causes negative reactivity particularly when it is metalinguistic in nature. (shrink)

The uniform continuity theorem states that every pointwise continuous real‐valued function on the unit interval is uniformly continuous. In constructive mathematics, is strictly stronger than the decidable fan theorem, but Loeb [17] has shown that the two principles become equivalent by encoding continuous real‐valued functions as type‐one functions. However, the precise relation between such type‐one functions and continuous real‐valued functions (usually described as type‐two objects) has been unknown. In this paper, we introduce an appropriate notion of continuity for a modulus (...) of a continuous real‐valued function on [0, 1], and show that real‐valued functions with continuous moduli are exactly those functions induced by Loeb's codes. Our characterisation relies on two assumptions: (1) real numbers are represented by regular sequences (equivalently Cauchy sequences with explicitly given moduli); (2) the continuity of a modulus is defined with respect to the product metric on the regular sequences inherited from the Baire space. Our result implies that is equivalent to the statement that every pointwise continuous real‐valued function on [0, 1] with a continuous modulus is uniformly continuous. We also show that is equivalent to a similar principle for real‐valued functions on the Cantor space. These results extend Berger's [2] characterisation of for integer‐valued functions on and unify some characterisations of in terms of functions having continuous moduli. (shrink)

The issue of justice after catastrophe is an enormous challenge to contemporary theories of distributive justice. In the past three decades, the controversy over distributive justice has centered on the ideal of equality. One of intensely debated issues concerns what is often called the “equality of what,” on which there are three primary views: welfarism, resourcism, and the capabilities approach. Another major point of dispute can be termed the “equality or another,” about which three positions debate: egalitarianism, prioritarianism, and sufficientarianism. (...) On these topics of distributive justice, authors are concerned with the current difference between the better-off and the worse-off or the present situation of the badly-off. By contrast, it is essential to take account of the past distribution of well-being as well as the present situation in order to explore questions of post-catastrophe justice. Without looking at the pre-disaster distribution of income, preference satisfaction, or basic capabilities among affected people, no present assessment of the damage caused by the disaster could be correct and no proposed remedy adequate. It is true that luck egalitarians assess the current distribution among people by referring to the decision that each individual made. Yet they pay scant attention to the situation in which each one stayed in the past. Therefore, we can legitimately say that most theorists of distributive justice, including luck egalitarians, have failed to give consideration to the past state of each person. -/- To fill this gap in the literature, the present article explores philosophical questions that arise when we take account of each person’s past and present situations in discussing distributive justice regarding public compensation and assistance to survivors and families of victims of natural and industrial disasters. In addressing these novel questions, I develop and refine various concepts, ideas, and arguments that have been presented in the study of distributive justice in normal settings. I tackle two tasks, the first of which is to explore the foundation and scope of luck egalitarianism. Despite the moral appeal it has in many cases, luck egalitarianism has attracted the so-called harshness objection. Some luck egalitarians attempt to avoid this objection in a pragmatic way by combining the luck egalitarian doctrine with the principle of basic needs satisfaction. However, they do not provide any systematic rationale for this combination. In contrast with such pragmatic responses, I seek to offer a principled argument for holding individuals responsible for their choices only when their basic needs are met, by invoking the ideas of respect for human voluntariness and rescue of human vulnerability. Based on this argument, I propose a form of responsibility-sensitive theory, which considers the pre-disaster distribution of well-being as a default position. The second task I take on is to refine sufficientarianism in the context of post-catastrophe justice. Luck egalitarianism with boundaries set by the basic needs principle seems to indicate the potential for sufficientarianism. But major proponents of this view conceive the welfarist assumption, a considerably high standard of well-being, and the controversial treatment of persons staying below the threshold, all of which seem problematic in the post-disaster situation. I try to construct a new version of sufficientarianism by replacing these current features with more robust ones. (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.

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)