The memory drum theory after twenty years

The difference between the Henry “memory-drum” theory and our version is that ours includes an additional assumption that, after programming has occurred, the resultant representation can be stored in short-term memory. Otherwise, the essential ideas are the same in the two theories. Implications of the presently available data for the distinction between the theories are discussed. Regardless of how one evaluates our added assumption, it is clear that the essential insight of the Henry theory has fared very well in the 20 yr since the theory first appeared in print.     

The profile structure for Luce's choice axiom

A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by starting with the “best-first,” or “worst-first” alternative. As shown, the problem is caused by the way we compute pairwise probabilities: it forces “best-first” and “worst-first” computations to use different information from a profile. Thus agreement holds only should the different information agree: this happens only with complete indifference. An alternative “best-first” and “worst-first” comparison, which always holds, is developed. Ways to increase the applicability of the choice axiom are introduced; e.g., profiles admitted by Luce's formulation for ten alternatives have nine degrees of freedom; the approach described here allows millions of degrees of freedom. New ways to compute probabilities, which combine “best-first” and “worst-first” computations, are given: their properties are identified with a profile decomposition. A new way to compute pairwise probabilities, which eliminates all profile restrictions and problems associated with the choice axiom, is introduced; e.g., “best-first” and “worst-first” computations now agree. Three and four alternatives are emphasized for reasons of exposition, but most results extend to any number of alternatives.     

Memory for events after twenty years

This is a study of one person's memory for events that occurred twenty years earlier. Memory was observed to follow an asymptotic rate of decay. No experience of recovered memories occurred. Factors found to be related to recall were the rarity of the event, its vividness, and the emotional intensity experienced at the time. Factors unrelated or only weakly related were perceived importance of the event, its association with knowledge, and intensities of physical sensations. Pleasant events were recalled a little better than unpleasant. Though less strongly associated with memory than is location, moderate marking of events with date and time was found. The results suggest that personal memory declines as the images of events one by one submerge into the mass of generalized experiences. The more vivid, rare, and emotional experiences are more likely to remain discriminable, and may be sustained by rehearsal. Copyright © 2002 John Wiley & Sons, Ltd.     

The memory drum theory after twenty years: comments on Henry's note

The difference between the Henry "memory-drum" theory and our version is that ours includes, an additional assumption that, after programming has occurred, the resultant representation can be stored in short-term memory. Otherwise, the essential ideas are the same in the two theories. Implications of the presently available data for the distinction between the theories are discussed. Regardless of how one evaluates our added assumption, it is clear that the essential insight of the Henry theory has fared very well in the 20 years since the theory first appeared in print.     

The journal of school psychology's first twenty years: Contributions and contributors

This article reports a retrospective view of the first 20 years of the Journal of School Psychology (JSP). The principal purpose of the review is to determine the number of contributors to JSP and their characteristics, the number and types of citations, and the most frequently referred authors, books, tests, and journals. Nine hundred and ten persons authored or coauthored one or more articles for JSP during its first 20 years. Among these 910, 764 contributed one article, and 8 contributed seven or more articles. The characteristics of these 8 persons are examined in detail in the present study. Six thousand seven hundred twenty-two separate references are cited within the 709 articles. The most frequently cited reference is Wechler's WISC and WISC-R (51). Other frequently cited tests include the PPVT (18), Bender-Gestalt (18), and WRAT (17). Caplan's The Theory and Practice of Mental Health Consultation (24) is the most frequently referenced book. JSP is the most frequently referenced journal. An examination of the total number of separate references appearing in the 709 articles reveals 65 separate references to Cowen, 43 to Dunn, 41 to Koppitz, and 40 to Caplan.     

Analysis and psychotherapy by telephone: twenty years of clinical experience

Psychoanalysis via telephone is becoming increasingly prevalent while remaining an area of comparatively little study. The author's early telephone treatment of a series of patients living some distance away or engaged in business travel, and his subsequent telephone treatment of nine analytic and five psychotherapy patients following his own geographic move, are discussed in detail. The mechanics of beginning and carrying out such treatment are examined. The theoretical implications of the shift to the telephone and the ambivalence with which it is often met by clinicians are also explored. The role of nonverbal communication in both in-person and telephone analysis is considered, as is the concept of the analytic office as a literal space and a psychological container. Suggestions for future research are advanced.     

The shortest possible length of the longest implicational axiom

A four-valued matrix is presented which validates all theorems of the implicational fragment, IF, of the classical sentential calculus in which at most two distinct sentence letters occur. The Wajsberg/Diamond-McKinsley Theorem for IF follows as a corollary: every complete set of axioms (with substitution and detachment as rules) must include at least one containing occurrences of three or more distinct sentence letters.Additionally, the matrix validates all IF theses built from nine or fewer occurrences of connectives and letters. So the classic result of Jaskovski for the full sentential calculus —that every complete axiom set must contain either two axioms of length at least nine or else one of length at least eleven—can be improved in the implicational case: every complete axiom set for IF must contain at least one axiom eleven or more characters long.Both results are best possible, and both apply as well to most subsystems of IF, e.g., the implicational fragments of the standard relevance logics, modal logics, the relatives of implicational intutionism, and logics in the ukasiewicz family.Earlier proofs of these results, utilizing a five-valued matrix built from the product matrix of C2 with itself via the method of [8], were obtained in 1988 while the author was a Visiting Research Fellow at the Automated Reasoning Project, Research School of Social Sciences, Australian National University, and were presented in [9]. The author owes thanks to the RSSS for creating the Project, and to the members of the Project generally for the stimulating atmosphere they created in turn, but especially to Robert K. Meyer for making the visit possible, and for many discussions over the years.     

An axiom system for orthomodular quantum logic

Logical matrices for orthomodular logic are introduced. The underlying algebraic structures are orthomodular lattices, where the conditional connective is the Sasaki arrow. An axiomatic calculusOMC is proposed for the orthomodular-valid formulas.OMC is based on two primitive connectives — the conditional, and the falsity constant. Of the five axiom schemata and two rules, only one pertains to the falsity constant. Soundness is routine. Completeness is demonstrated using standard algebraic techniques. The Lindenbaum-Tarski algebra ofOMC is constructed, and it is shown to be an orthomodular lattice whose unit element is the equivalence class of theses ofOMC.This research was supported by National Science Foundation Grant Number SOC76-82527.