Hindsight bias: An interaction of automatic and motivational factors?

If subjects are asked to recollect a former response after having been informed about the correct response, their recollection tends to approach the correct response. This effect has been termedhindsight bias. We studied hindsight bias in an experiment requiring numerical responses to almanac-type questions for physical quantities. We varied (1) the time at which the correct information was provided, (2) the encoding of the original responses by asking/not asking subjects to give a reason for the respective response, and (3) the motivation to recall correctly. We found that hindsight is less biased if reasons are given and if the correct information is provided at an earlier time. Motivation had only interactive effects: (1) With high motivation to recall correctly, the time the correct information was provided had no influence. (2) With reasons given, the variation of motivation showed no effect. These results rule out purely motivational and purely automatic explanations.     

Fixation accuracy and perceptual asymmetry for consonants

Fixation accuracy was related to perception of laterally presented consonants. Small left-eye fixation inaccuracy influenced perceptual performance of 8 men and 8 women.     

Interhemispheric integration of compound nouns: effects of stimulus arrangement and mode of presentation

Normal subjects had to name German compound nouns which were presented tachistoscopically. The compound nouns were displayed either unilaterally to the left or right visual field or bilaterally with one element to each visual field. In the bilateral condition a distinction was made as to whether familiar or unfamiliar arrangement of the elements was used. Representation in print was compared with pictorial representation of the compound nouns. A right visual-field superiority was observed with printed representation, but no laterality effects with pictorial representation. Bilateral processing was superior to unilateral processing. Within the bilateral conditions, the familiar arrangement of the elements yielded a significantly better performance than unfamiliar arrangement. This difference can be explained by reading habits and/or by different styles of interhemispheric integration.     

A connectivity model for semantic processing

Summary A connectivity model for semantic processing, based on two major assumptions, is proposed and tested. The representation assumption states that semantically related features are represented by an interconnected structure of features. A network is termed interconnected if each node is linked to at least two other nodes. According to the processing assumption, indirect activation becomes increasingly effective as the number of interconnected nodes increases. The connectivity model thus predicts that more complex concepts will be processed faster than less complex concepts. Experiment 1 was performed to determine the number of features for a set of 72 words and to show that subordinate concepts share common features with their natural superordinate concept. In Experiments 2 and 3 subjects had to judge whether or not a word belonged to a previously defined natural superordinate concept. The results confirm the connectivity model and show that concepts with many features can be classified faster than concepts with only a few features.This research was supported by a Grant of the Max Kade Foundation     

Applications of weak Kripke semantics to intermediate consequences

Section 1 contains a Kripke-style completeness theorem for arbitrary intermediate consequences. In Section 2 we apply weak Kripke semantics to splittings in order to obtain generalized axiomatization criteria of the Jankov-type. Section 3 presents new and short proofs of recent results on implicationless intermediate consequences. In Section 4 we prove that these consequences admit no deduction theorem. In Section 5 all maximal logics in the 3 ^rd counterslice are determined. On these results we reported at the 1980 meeting on Mathematical Logic at Oberwolfach. This paper concerns propositional logic only.     

On reduced matrices

It is shown that the class of reduced matrices of a logic is a 1 ^st order -class provided the variety associated with has the finite replacement property in the sense of [7]. This applies in particular to all 2-valued logics. For 3-valued logics the class of reduced matrices need not be 1 ^st order.