Both Ambrose St. John (1815–1875) and John Henry Newman (1801–1890), who were received into the Roman Catholic Church in 1845, became members of the Birmingham Oratory. Newman’s closest companion for over three decades, St. John’s death was extremely painful for Newman, not only because it was unexpected, but because of his devotion to Newman as well as his dedication to his spiritual duties. Along with presenting Newman’s narrative of the last few weeks of St. John’s life, this essay raises the (...) question: why did Newman write this “account.”. (shrink)

壊滅した街の瓦礫の中で人びとは、前日までと同じように分けあい、助けあった。非常時にも日常の倫理を喪わない、日本人の心性の源泉を近世の儒学思想に求め、明日への生き方を確かめる。.

Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.

John Henry Newman has rightly been hailed as a giant in the Catholic intellectual tradition. His contributions to theology, literature, and education have been studied at length; however, his contribution to philosophy has not received appropriate attention. This essay 1) explores Newman’s unique philosophical insights in terms of the phenomenological tradition of Edmund Husserl; 2) analyzes the transcendental approach of certain British scientists—notably Ronald Knox and Charles Darwin; and 3) discusses how Newman might be considered a phenomenologist.

中国・南宋の朱熹の思想、朱子学は江戸時代においていかなる機能を果たしたのか―。受容とともに新たな思考が生まれてゆくさまは、従来の体制教学という理解を一面的なものとせずにはいない。とりわけ、朱子学と反朱 子学の応酬は結果としてこの時代の思想表現を豊かなものにし、日本の近代化への足掛かりをも作った。本書では、朱子学の骨格から江戸時代における展開、近代化に及ぼした作用までを論じ、日本近世の知的状況を眺望す る。.

Glivenko-type theorems for substructural logics are comprehensively studied in the paper [N. Galatos, H. Ono, Glivenko theorems for substructural logics over FL, Journal of Symbolic Logic 71 1353–1384]. Arguments used there are fully algebraic, and based on the fact that all substructural logics are algebraizable 279–308] and also [N. Galatos, P. Jipsen, T. Kowalski, H. Ono, Residuated Lattices: An Algebraic Glimpse at Substructural Logics, in: Studies in Logic and the Foundations of Mathematics, vol. 151, Elsevier, 2007] for the details). As (...) a complementary work to the algebraic approach developed in [N. Galatos, H. Ono, Glivenko theorems for substructural logics over FL, Journal of Symbolic Logic 71 1353–1384], we present here a concise, proof-theoretic approach to Glivenko theorems for substructural logics. This will show different features of these two approaches. (shrink)

Some modal logics based on logics weaker than the classical logic have been studied by Fitch [4], Prior [7], Bull [1], [2], [3], Prawitz [6] etc. Here we treat modal logics based on the intuitionistic propositional logic, which call intuitionistic modal logics.

In this paper, a semantics for predicate logics without the contraction rule will be investigated and the completeness theorem will be proved. Moreover, it will be found out that our semantics has a close connection with Beth-type semantics.

Prediction is essential for the efficiency of many cognitive processes; however, this process is not always perfect. Predictive coding theory suggests that the brain generates and updates a prediction to respond to an upcoming event. Although an electrophysiological index of prediction, the stimulus preceding negativity, has been reported, it remains unknown whether the SPN reflects the prediction accuracy, or whether it is associated with the prediction error, which corresponds to a mismatch between a prediction and an actual input. Thus, the (...) present study aimed to investigate this question using electroencephalography. Participants were asked to predict the original pictures from pictures that had undergone different levels of pixelation. The SPN amplitude was affected by the level of pixelation and correlated with the subjective evaluation of the prediction accuracy. Furthermore, late positive components were negatively correlated with SPN. These results suggest that the amplitude of SPN reflects the prediction accuracy; more accurate prediction increases the SPN and reduces the prediction error, resulting in reduced LPC amplitudes. (shrink)

We examined the effects of unconscious priming on temporal-interval production. In Experiment 1, participants were instructed to keep visual displays on a screen for 2500 ms intervals. Half of the displays were repeated across blocks throughout the entire experiment, and the others were newly generated from trial to trial. The displays consisted of patterns so complex that the participants could not intentionally memorize them. The results showed that significantly more time elapsed for old displays than for new displays before participants (...) indicated that a 2500 ms interval had elapsed. Experiment 2 replicated this effect and excluded an alternative account based on perceived pattern complexity. The effect of repetitive presentation was obtained despite the fact the participants did not recognize the repetition, suggesting that unconscious priming increased temporal production. These results suggest that time perception is affected by an unconscious process. (shrink)

This paper discusses Crawley completions of residuated lattices. While MacNeille completions have been studied recently in relation to logic, Crawley completions (i.e. complete ideal completions), which are another kind of regular completions, have not been discussed much in this relation while many important algebraic works on Crawley completions had been done until the end of the 70’s. In this paper, basic algebraic properties of ideal completions and Crawley completions of residuated lattices are studied first in their conncetion with the join (...) infinite distributivity and Heyting implication. Then some results on algebraic completeness and conservativity of Heyting implication in substructural predicate logics are obtained as their consequences. (shrink)

In this paper, we will develop an algebraic study of substructural propositional logics over FLew, i.e. the logic which is obtained from intuitionistic logics by eliminating the contraction rule. Our main technical tool is to use residuated lattices as the algebraic semantics for them. This enables us to study different kinds of nonclassical logics, including intermediate logics, BCK-logics, Lukasiewicz’s many-valued logics and fuzzy logics, within a uniform framework.

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on substructural logics over the full Lambek Calculus [34], Galatos and Ono [18], Galatos et al. [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic associated (...) with and is algebraizable, with the variety of residuated lattice-ordered groupoids with unit serving as its equivalent algebraic semantics. Overcoming technical complications arising from the lack of associativity, we introduce a generalized version of a logical matrix and apply the method of quasicompletions to obtain an algebra and a quasiembedding from the matrix to the algebra. By applying the general result to specific cases, we obtain important logical and algebraic properties, including the cut elimination of and various extensions, the strong separation of , and the finite generation of the variety of residuated lattice-ordered groupoids with unit. (shrink)

An intermediate predicate logicS + n (n>0) is introduced and investigated. First, a sequent calculusGS n is introduced, which is shown to be equivalent toS + n and for which the cut elimination theorem holds. In § 2, it will be shown thatS + n is characterized by the class of all linear Kripke frames of the heightn.