Testosterone and cortisol responses to competitive fighting in human males: A pilot study

Serum testosterone and cortisol levels were measured by radioimmunoassay in 14 young male judo competitors, in samples taken 10 minutes before and 45 minutes after two different procedures. The first involved physical exercise and the second competitive fighting. Both procedures were of 5 minutes duration and sessions took place at the same time (between 10:00 A.M. and 12:00 P.M. local time) but on different days. Comparing the two situations over all subjects revealed that testosterone increased after exercise and decreased slightly after Competition. Between subject comparisons suggested that contrary to previous claims, winning or losing did not significantly change the testosterone and cortisol levels. Comparisons of subjects who were members of the Regional Team with individuals who were not part of that group confirmed that members increased their testosterone levels after competition, whereas the nonmembers showed a significant decrease. Moreover, success of the individuals, in their sporting record, correlated positively and significantly with the changes of testosterone observed during the competition. These preliminary results suggest that previous personal experience of success can influence the pattern of the psychoendocrine response to a contest situation.     

Does classroom social comparison bias students’ evaluation of their own competence?

Social Psychology of Education - Overestimation and underestimation of students’ own competence result from social comparison in the classroom. There is some evidence that secondary school...     

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