Context-dependent effects on analogical transfer

The role of context in facilitating analogical transfer was investigated in two experiments. In both experiments, subjects first read two stories that were analogous to Duncker’s (1945) radiation problem. Later, subjects attempted to solve the radiation problem. In Experiment 1, the radiation problem was presented in a different context than that of the stories, and followed them by 6 min. Transfer was observed in subjects who were prompted to use the earlier stories in solving the problem. However, the solution frequency of subjects not given such prompts did not differ from control levels. In Experiment 2, the radiation problem was presented in the same context as the earlier stories to some subjects, and in a different context to others. The timing of the radiation problem also was varied. When a 6-min interval separated the stories from the radiation problem, transfer was a function of context, with weak transfer being observed in the samecontext condition, and no transfer being observed in the different-context condition. At a 45-sec delay, transfer was again observed in the same~ontext condition, and a nonsignificant trend toward transfer was observed in the different-context condition. The results were interpreted as indicating that context facilitates the retrieval of relevant problem-solving schemas, and as suggesting that the possession of relevant schemas is not sufficient to produce analogical transfer.     

Classification of empirically derived prototypes as a function of category experience

In three experiments, subjects learned to classify dot patterns into three categories represented by either three, six, or nine exemplars. Following learning, subjects were tested on an additional set of patterns, which included patterns from the learning phase, the category objective prototypes, and new distortions of the objective prototypes. Also included in the test set were empirical prototypes and distortions of empirical prototypes. Empirical prototypes were derived by averaging feature values of category exemplars in the learning phase. The overall results revealed that empirical prototypes were classified more accurately than were objective prototypes. In addition, a pattern of convergence in error rates was observed for distortions of the objective and empirical prototypes as category set size increased, but this same pattern was not observed for the objective and empirical prototypes themselves. This lack of convergence for the prototypes is inconsistent with explanations of the category set size effect that rely on the central limit theorem.     

The role of phonemes and syllables in the perceived similarity of speech sounds for children

In two experiments, we investigated the factors that influence the perceived similarity of speech sounds at two developmental levels. Kindergartners and second graders were asked to classify nonsense words, which were related by syllable and phoneme correspondences. The results support the existence of a developmental trend toward increased attention to individual phonemic segments. Moreover, one significant factor in determining the perceived similarity of speech sounds appears to be the position of the component correspondences; attention to the beginning of utterances may have developmental priority. An unexpected finding was that the linguistic status of the unit involved in a correspondence (whether it was a syllable or a phoneme) did not seem particularly important. Apparently, the factors which contribute to the perceived similarity of speech sounds in the classification task are not identical to those which underlie performance in explicit segmentation and manipulation tasks, since in the latter sort of task, syllables are more accessible than phonemes for young children. The present task may tap a level of processing that is closer to the one entailed in word recognition and lexical access.     

Some modifications of Scott's theorem on injective spaces

D. Scott in his paper [5] on the mathematical models for the Church-Curry -calculus proved the following theorem.A topological space X. is an absolute extensor for the category of all topological spaces iff a contraction of X. is a topological space of Scott's open sets in a continuous lattice.In this paper we prove a generalization of this theorem for the category of , -closure spaces. The main theorem says that, for some cardinal numbers , , absolute extensors for the category of , -closure spaces are exactly , -closure spaces of , -filters in , >-semidistributive lattices (Theorem 3.5).If = and = we obtain Scott's Theorem (Corollary 2.1). If = 0 and = we obtain a characterization of closure spaces of filters in a complete Heyting lattice (Corollary 3.4). If = 0 and = we obtain a characterization of closure space of all principial filters in a completely distributive complete lattice (Corollary 3.3).     

On decidable consequence operators

The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable.     

Maps between some different kinds of contraction function: The finite case

In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose of the present paper is to study the relationship more finely, by seeking an explicit map between the component orderings involved in each of the two kinds of contraction. It is shown that at least in the finite case a suitable map exists, with the consequence that the relational, transitively relational, and antisymmetrically relational partial meet contraction functions form identifiable subclasses of the safe contraction functions, over any theory finite modulo logical equivalence. In the process of constructing the map, as the composition of four simple transformations, mediating notions of bottom and top contraction are introduced. The study of the infinite case remains open.     

Identification with an aggressor or a victim and its relation to creativity

Studied identification using a meta-contrast design. The first stimulus was the word 'I'. The second stimulus depicted an aggressor and a victim facing each other. The subliminal 'I' was flashed on either the victim or on the aggressor, or completely withheld. The subjects were 33 school children, aged 10–12 years. They also took a percept-genetic (PG) test of creativity, measuring willingness to return to and recognize early conceptions of a stimulus picture (a still-life). The results showed that the creative children reacted with less anxiety and defense when manipulated to identify with the aggressor than with the victim. The uncreative children showed the opposite reaction, namely a preference for the passive, surrendering victim.     

Latent trait models and dichotomization of graded responses

This paper discusses thecompatibility of the polychotomous Rasch model with dichotomization of the response continuum. It is argued that in the case of graded responses, the response categories presented to the subject are essentially an arbitrary polychotomization of the response continuum, ranging for example from total rejection or disagreement to total acceptance or agreement of an item or statement. Because of this arbitrariness, the measurement outcome should be independent of the specific polychotomization applied, for example, presenting a specific multicategory response format should not affect the measurement outcome. When such is the case, the original polychotomous model is called compatible with dichotomization.A distinction is made between polychotomization or dichotomization before the fact, that is, in constructing the response format, and polycho- or dichotomization after the fact, for example in dichotomizing existing graded response data.It is shown that, at least in case of dichotomization after-the-fact, the polychotomous Rasch model is not compatible with dichotomization, unless a rather special condition of the model parameters is met. Insofar as it may be argued that dichotomization before the fact is not essentially different from dichotomization after the fact, the value of the unidimensional polychotomous Rasch model is consequently questionable. The impact of our conclusion on related models is also discussed.     

A family of chance-corrected association coefficients for metric scales

A chance-corrected version of the family of association coefficients for metric scales proposed by Zegers and ten Berge is presented. It is shown that a matrix with chance-corrected coefficients between a number of variables is Gramian. The members of the chance-corrected family are shown to be partially ordered. The author is obliged to Jos ten Berge for helpful comments.