Is visual attention automatically attracted by one’s own name?

Subjects were presented with briefly exposed visual displays of words that were common first names with a length of four to six letters. In the main experiment, each display consisted of four words: two names shown in red and two shown in white. The subject’s task was to report the red names (targets), but ignore the white ones (distractors). On some trials the subject’s own name appeared as a display item (target or distractor). Presentation of the subject’s name as a distractor caused no more interference with report of targets than did presentation of other names as distractors. Apparently, visual attention was not automatically attracted by the subject’s own name.     

Fuzzy Logic and Arithmetical Hierarchy,II

A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.     

Towards an Interactive Acculturation Model: A Social Psychological Approach

The first part of this paper proposes a continuum of ideological premises that seeks to account for the broad range of immigrant integration policies adopted by Western democratic states. In the second part, a review of Social Psychological models of immigrant acculturation strategies demonstrates the need to explain more clearly the interactive nature of immigrant and host community relations. The Interactive Acculturation Model (IAM) presented next proposes that relational outcomes are the product of the acculturation orientations of both the host majority and immigrant groups as influenced by state integration policies. The model makes predictions regarding the acculturation combinations most likely to produce consensual, problematic, and conflictual relational outcomes between immigrants and members of the host community. Social psychological research is needed to test the validity of the IAM model empirically.     

Cut-free sequent and tableau systems for propositional Diodorean modal logics

We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved are always bounded by a finite set of formulaeX* _L depending only onX and the logicL. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive.Each tableau system has a cut-free sequent analogue proving that Gentzen's cut-elimination theorem holds for these latter systems. The techniques are due to Hintikka and Rautenberg.Presented byDov M. Gabbay