Stress from dominance ranks in human societies, or that of other social animals, especially nonhuman primates, can have negative influences on health. Individuals holding different social status may be burdened with various stress levels. The middle class experiences a special stress situation within the dominance hierarchy due to its position between the higher and lower classes. Behaviorally,...

The object of hierarchy theory is to break down certain classes of predicates into subclasses of gradually increasing complexity. An excellent example is furnished by the hyperarithmetical hierarchy. Here each class in the hierarchy is obtained from the previous class by adding a single number quantifier. The Souslin-Kleene theorem [2, XXIV] then tells us that the predicates occurring in the hi...

We begin by proving that the class of problems accepted by the program schemes of NPS is exactly the class of problems defined by the sentences of transitive closure logic (program schemes of NPS are obtained by generalizing basic non-deterministic while-programs whose tests within while instructions are quantifier-free first-order formulae). We then show that our program schemes form a proper ...

Multiple class hierarchies can be used each to represent a separate requirement or design concern. To yield a working system, these disparate hierarchies must be composed in a semantically meaningful way. However, cycles can arise in the composed inheritance graph that restrict the space of composable hierarchies. This work presents an approach to eliminating these cycles by means of separating...

Attribute reduction of rough set theory underlies knowledge acquisition and has two hierarchical types (classification-based class-specific attribute reducts) perspectives from algebra information theory; thus, there are four combined modes in total. Informational reducts fundamental but lacking thus investigated by correspondingly constructing measures. First, three measures (i.e., entropy, co...

This article extends a paper of Abraham and Bonnet which generalised the famous Hausdorff characterisation of the class of scattered linear orders. Abraham and Bonnet gave a poset hierarchy that characterised the class of scattered posets which do not have infinite antichains (abbreviated FAC for finite antichain condition). An antichain here is taken in the sense of incomparability. We define ...

For a particular class of integral operators K we show that the quantity φ := log det (I +K)− log det (I −K) satisfies both the integrated mKdV hierarchy and the sinh-Gordon hierarchy. This proves a conjecture of Zamolodchikov.