A connection graph represents resolvability in a set of clauses explicitly. The corresponding connection graph proof procedure has the deeciency that the graphs may grow, becoming impractical to handle. We present a novel proof procedure for condition graphs, which is a reenement of connection graphs. Our idea is to control the growth of the graph by recognizing tests in clauses and translating...

Laan in (Ph.D Thesis, Tartu. 1999) introduced the principal weak form of Condition $(P)$ as Condition $(PWP)$ and gave some characterization of monoids by this condition of their acts. In this paper first we introduce Condition (G-PWP), a generalization of Condition $(PWP)$ of acts over monoids and then will give a characterization of monoids when all right acts satisfy this condition. We also ...

In this paper we introduce condition (E?P) a generalization of Conditions (E?), (E) and (P) of acts over monoids and will give a classification of monoids by comparing this condition of their (Rees factor) acts with other properties. We give also a criterion of cyclic acts to satisfy Condition (E?P).

this paper is devoted to the study of products of classes of right $s$-posets possessing one of the flatness properties and preservation of such properties under products. specifically, we characterize a pomonoid $s$ over which its nonempty products as right $s$-posets satisfy some known flatness properties. generalizing this results, we investigate products of right $s$-posets satisfying condi...

In a paper in this issue, Rief et al. [1] present a new scale for assessing illness behaviour. The Scale of the Assessment of Illness Behaviour (SAIB) comprises five dimensions: verification of diagnosis, expression of symptoms, medication reliance, illness consequences and bodily scanning. The initial validation of the scale has been completed through comparison of patients presenting with une...

Various normwise relative condition numbers that measure the sensitivity of Bott– Duffin inverse and the solution of constrained linear systems are characterized. The sensitivity of condition number itself is then investigated. Finally, upper bounds are derived for the sensitivity of componentwise condition numbers. 2002 Elsevier Science Inc. All rights reserved.