日本史・日本思想史・日本文学から葉隠の歴史に迫る。現代人が無意識に前提としてきた「日本」「武士道」の認識枠組みを問う初の書。.

Che 1-pu. Han'guk ŭi kaebyŏk -- 1. Kŭndae Han'guk konggongsŏng ŭi chŏn'gae wa t'aja waŭi yŏndae -- 2. Kŭndae Han'guk siminjŏk konggongsŏng ŭi sŏngnip -- 3. Taejonggyo pŏmt'unggusŭjuŭi wa pop'yŏnjuŭi -- Che 2-pu. Ilbon ŭi kaebyŏk -- 1. Kŭnse Ilbon sasang ŭi Sŏngin'gwan -- 2. Ilbon sinjonggyo ŭi kaebyŏk undong -- 3. Hyŏndae Ilbon ŭi saengmyŏng yŏngsŏng kwa ch'iyu yŏngsŏng -- Che 3-pu. Sirhak ŭi sigak -- 1. 19-segi sirhakcha ŭi Ilbon insik -- 2. Ch'oe Han-gi ŭi chonggyo hoet'ong sasang (...) -- 3. Han'guk, Ilbon, Chungguk e issŏsŏ 'Sinsirhangnon' pigyo -- Che 4-pu. Pigyo ŭi sigak -- 1. Ilbon esŏŭi T'oegye, Yulgok, Tasan yŏn'gu ŭi hŭrŭm -- 2. Ch'oe Han-gi wa Ilbon ŭi konggong sasangga pigyo yŏn'gu -- 3. Tongsŏyang konggongsŏng yŏn'gu wa Han'gukchŏk konggongsŏn. (shrink)

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

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)

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)

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

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.

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)