Previous studies have shown different developmental trajectories for object recognition of solid and non-solid objects. However, there is no evidence as to whether infants have expectations regarding certain attributes of objects, such as surface hardness, in the absence of tactile information. In the present study, we examined infants’ perception of the hardness of object surfaces from visually presented penetration events using the familiarization–novelty preference procedure. Experiment 1 showed that by 11 months old infants distinguished a relatively soft surface from a (...) crusty surface based on changes in the velocity of a moving object as the moving object penetrated the surface of the target object. Experiment 2 ruled out the possibility that infants were merely sensitive to differences in the velocity changes in the stimuli. (shrink)

Representational momentum is a well-known phenomenon that occurs when a moving object vanishes suddenly and the memory of its final or vanishing position is displaced forward in the direction of its motion. Many studies have shown evidence of various perceptual and cognitive characteristics of RM in various daily aspects, sports, development, and aging. Here we examined the longitudinal developmental changes in the displacement magnitudes of RM among younger and older nursery school children for pointing and judging tasks. In our experiments, (...) the children were asked to point at by their finger and judge the spatial location of the vanishing point of a moving stimulus. Our results showed that the mean magnitudes of RM significantly decreased from 5- to 6-year-old children for the pointing and judging tasks, although the mean magnitude of RM was significantly greater in the 5-year-old children for the pointing task but not for the judging task. We further examined the developmental changes in RM for a wide range of ages based on data from the present study and our previous study. This ad hoc examination showed that the magnitude of RM was significantly greater in 5-year-old children than in adults for the pointing and judging tasks. Our findings suggest that the magnitude of RM was significantly greater in young children than in adults and significantly decreased in young children through adults for the pointing and judging tasks. (shrink)

Wajsberg and Jankov provided us with methods of constructing a continuum of logics. However, their methods are not suitable for super-intuitionistic and modal predicate logics. The aim of this paper is to present simple ways of modification of their methods appropriate for such logics. We give some concrete applications as generic examples. Among others, we show that there is a continuum of logics (1) between the intuitionistic predicate logic and the logic of constant domains, (2) between a predicate extension ofS4 (...) andS4 with the Barcan formula. Furthermore, we prove that (3) there is a continuum of predicate logics with equality whose equality-free fragment is just the intuitionistic predicate logic. (shrink)

We discuss relationships among the existence property, the disjunction property, and their weak variants in the setting of intermediate predicate logics. We deal with the weak and sentential existence properties, and the Z-normality, which is a weak variant of the disjunction property. These weak variants were presented in the author’s previous paper [16]. In the present paper, the Kripke sheaf semantics is used.

Modal counterparts of intermediate predicate logics will be studied by means of algebraic devise. Our main tool will be a construction of algebraic semantics for modal logics from algebraic frames for predicate logics. Uncountably many examples of modal counterparts of intermediate predicate logics will be given.

A possible world structure consist of a set W of possible worlds and an accessibility relation R. We take a partial function r(·,·) to the unit interval [0, 1] instead of R and obtain a Kripke frame with graded accessibility r Intuitively, r(x, y) can be regarded as the reliability factor of y from x We deal with multimodal logics corresponding to Kripke frames with graded accessibility in a fairly general setting. This setting provides us with a framework for fuzzy (...) possible world semantics. The basic propositional multimodal logic gK (grated K) is defined syntactically. We prove that gK is sound and complete with respect to this semantics. We discuss some extensions of gK including logics of similarity relations and of fuzzy orderings. We present a modified filtration method and prove that gK and its extensions introduced here are decidable. (shrink)

Some properties of Kripke-sheaf semantics for super-intuitionistic predicate logics are shown. The concept ofp-morphisms between Kripke sheaves is introduced. It is shown that if there exists ap-morphism from a Kripke sheaf 1 into 2 then the logic characterized by 1 is contained in the logic characterized by 2. Examples of Kripke-sheaf complete and finitely axiomatizable super-intuitionistic (and intermediate) predicate logics each of which is Kripke-frame incomplete are given. A correction to the author's previous paper Kripke bundles for intermediate predicate logics (...) and Kripke frames for intuitionistic modal logics (Studia Logica, 49(1990), pp. 289–306 ) is stated. (shrink)

In so-called Kripke-type models, each sentence is assigned either to true or to false at each possible world. In this setting, every possible world has the two-valued Boolean algebra as the set of truth values. Instead, we take a collection of algebras each of which is attached to a world as the set of truth values at the world, and obtain an extended semantics based on the traditional Kripke-type semantics, which we call here the algebraic Kripke semantics. We introduce algebraic (...) Kripke sheaf semantics for super-intuitionistic and modal predicate logics, and discuss some basic properties. We can state the Gödel-McKinsey-Tarski translation theorem within this semantics. Further, we show new results on super-intuitionistic predicate logics. We prove that there exists a continuum of super-intuitionistic predicate logics each of which has both of the disjunction and existence properties and moreover the same propositional fragment as the intuitionistic logic. (shrink)

The first “test-tube baby” in Japan was born in March, 1983 at Tohoku University Hospital. Since then ten years have passed. Table 1 indicares the clinical results of in vitro fertilization in this country. As it shows, more than 145 institutions perform IVF, and more than 3,000 babies have now been born using this procedure.According to the recommendations issued in October, 1983 by the Japan Society of Obstetrics and Gynecology, IVF is defined as a medical practice for treating infertility, and (...) this procedure is performed only on married couples de jure. Eggs and embryos are not donated for IVF in Japan, nor does any “lending” or “leasing” of wombs take place. However, inFebruary, 1988 the Japan Society of Obstetrics and Gynecology issued new recommendations which allow clinical use of frozen embryos and eggs. The first baby from a frozen embryo was born in 1989, and 60 babies have been born to date. (shrink)

One criterion of constructive logics is the disjunction, property (DP). The Halldén-completeness is a weak DP, and is related to the relevance principle and variable separation. This concept is well-understood in the case of propositional logics. We extend this notion to predicate logics. Then three counterparts naturally arise. We discuss relationships between these properties and meet-irreducibility in the lattice of logics.

This article addresses the problem of automatically extracting legal indices which express the important contents of legal documents. Legal indices are not limited to single-word keywords and compound-word keywords, they are also clause keywords. We approach index extraction using structural information of Japanese sentences, i.e. chunks and clauses. Based on the assumption that legal indices are composed of important tokens from the documents, extracting legal indices is treated as a problem of collecting chunks and clauses that contain as many important (...) tokens as possible. Each token is assigned a weight which is a statistical score, e.g. TF–IDF and Okapi BM25, to indicate its importance. The importance of a chunk or clause is determined based on the average weight of tokens included in that chunk or clause. Then, highly weighted chunks and clauses are recognized as the indices for legal documents. The experimental results on Japanese National Pension Act data show that our proposed method achieves better performance than TextRank, the most popular unsupervised method in extracting single-word and compound-word keywords. In addition, this approach is also applicable to extract clause keywords with high performance. (shrink)

I attempt to develop further the statistical interpretation of quantum mechanics proposed by Einstein and developed by Popper, Ballentine, etc. Two ideas are proposed in the present paper. One is to interpret momentum as a property of an ensemble of similarly prepared systems which is not satisfied by any one member of the ensemble of systems. Momentum is regarded as a statistical parameter like temperature in statistical mechanics. The other is the holistic assumption that a probability distribution is determined as (...) a whole as most likely to be realized. This is the same as the chief assumption in statistical mechanics, and maximum likelihood in classical statistics. These ideas enable us to understand statistically (1) the formalism of quantum mechanics, (2) Heisenberg's uncertainty relations, and (3) the origin of quantum equations. They also explain violation of Bell's inequality and the interference of probabilities. (shrink)

Shehtman and Skvortsov introduced Kripke bundles as semantics of non-classical first-order predicate logics. We show the structural equivalence between Kripke bundles for intermediate predicate lógics and Kripke-type frames for intuitionistic modal propositional logics. This equivalence enables us to develop the semantical study of relations between intermediate predicate logics and intuitionistic modal propositional logics. New examples of modal counterparts of intermediate predicate logics are given.

As evidenced by high-throughput sequencers, genomic technologies have recently undergone radical advances. These technologies enable comprehensive sequencing of personal genomes considerably more efficiently and less expensively than heretofore. These developments present a challenge to the conventional framework of biomedical ethics; under these changing circumstances, each research project has to develop a pragmatic research policy. Based on the experience with a new large-scale project—the Genome Science Project—this article presents a novel approach to conducting a specific policy for personal genome research in (...) the Japanese context. In creating an original informed-consent form template for the project, we present a two-tiered process: making the draft of the template following an analysis of national and international policies; refining the draft template in conjunction with genome project researchers for practical application. Through practical use of the template, we have gained valuable experience in addressing challenges in the ethical review process, such as the importance of sharing details of the latest developments in genomics with members of research ethics committees. We discuss certain limitations of the conventional concept of informed consent and its governance system and suggest the potential of an alternative process using information technology. (shrink)

Schedule planning is one of the most crucial issues for any airline company, because the profit of the company directly depends on the efficiency of the schedule. This paper presents a novel scheduling method which solves problems related to time scheduling, fleet assignment and maintenance routing simultaneously by Genetic Algorithms. Every schedule constraint is embeded in the fitness function, which is described as an object oriented model and works as a simulater developing itself over time, and whose solution is executable (...) without human correction. The schedular is able to solve the problems involving several hundred flights in a few hours, and the solutions are superior or equivalent to those by human experts in terms of the estimated profit. (shrink)

Kaneko-Suzuki developed epistemic logics of shallow depths with multiple players for investigations of game theoretical problems. By shallow depth, we mean that nested occurrences of belief operators of players in formulae are restricted, typically to be of finite depths, by a given epistemic structure. In this paper, we develop various methods of surgical operations (cut and paste) of epistemic world models. An example is a bouquet-making, i.e., tying several models into a bouquet. Another example is to engraft a model to (...) some branches of another model. By these methods, we obtain various meta-theorems on semantics and syntax on epistemic logics. To illustrate possible uses of our meta-theorems, we present one game theoretical theorem, which is also a meta-theorem in the sense of logic. (shrink)

In [STU 00, KUT 03] we introduced a family of ‘modal' languages intended for talking about distances. These languages are interpreted in ‘distance spaces' which satisfy some of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to axiomatize the modal fragments of the semantically defined distance logics of [KUT 03] and give a new proof of (...) their decidability. (shrink)

We develop a series of small infinitary epistemic logics to study deductive inference involving intra-/interpersonal beliefs/knowledge such as common knowledge, common beliefs, and infinite regress of beliefs. Specifically, propositional epistemic logics GL are presented for ordinal α up to a given αo so that GL is finitary KDn with n agents and GL allows conjunctions of certain countably infinite formulae. GL is small in that the language is countable and can be constructive. The set of formulae Lα is increasing up (...) to α = ω but stops at ω We present Kripke-completeness for GL for each α ≤ ω, which is proved using the Rasiowa–Sikorski lemma and Tanaka–Ono lemma. GL has a sufficient expressive power to discuss intra-/interpersonal beliefs with infinite lengths. As applications, we discuss the explicit definability of Axioms T, 4, 5, and of common knowledge in GL Also, we discuss the rationalizability concept in game theory in our framework. We evaluate where these discussions are done in the series GL, α ≤ ω. (shrink)

We aim at developing a systematic method of separating omniscience principles by constructing Kripke models for intuitionistic predicate logic $\mathbf {IQC}$ and first-order arithmetic $\mathbf {HA}$ from a Kripke model for intuitionistic propositional logic $\mathbf {IPC}$. To this end, we introduce the notion of an extended frame, and show that each IPC-Kripke model generates an extended frame. By using the extended frame generated by an IPC-Kripke model, we give a separation theorem of a schema from a set of schemata in (...) $\mathbf {IQC}$ and a separation theorem of a sentence from a set of schemata in $\mathbf {HA}$. We see several examples which give us separations among omniscience principles. (shrink)

In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as fixed-point ones and infinitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among them are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these extensions turn out to be all Kripke complete and can be comparable in a meaningful manner. F. Wolter (...) showed that the predicate extension of the Halpern-Moses fixed-point type common knowledge logic is Kripke incomplete. However, if we go further to an infinitary extension, Kripke completeness would be recovered. Thus there is some gap in the predicate case. In drawing the map, we focus on what is happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole. (shrink)