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, some categorical properties of the category ${bf Cpo}_{{bf Act}text{-}S}$ of all {cpo $S$-acts}, cpo's equipped with actions of a monoid $S$ on them, and strict continuous action-preserving maps between them is considered. In particular, we describe products and coproducts in this category, and consider monomorphisms and epimorphisms. Also, we show that the forgetful functor from...

Recall that a pseudofree group action on a space is one whose singular set consists only of isolated points. In this paper, we classify all of the finite groups which admit pseudofree actions on S × S. The groups are exactly those which admit orthogonal pseudofree actions on S×S ⊂ R×R, and they are explicitly listed. This paper can be viewed as a companion to a paper of Edmonds [6], which unifo...

after forty years, the act of motor vehicle compulsory insurance was amended in 1387(2008).the act has changed some areas and protected third parties rather than former act. some protections are: increasing third parties, development of sphere of insurance and acceptance of an insurance policy as a mortgage in courts. however we see some ambiguities in the late act. the article analyses changes...

For a semigroup S we define some operations on the set of soft S-acts. Also by defining the soft congruence we introduce the notion of bi-act. The purpose of this paper is to investigate certain results on the soft bi-acts. Some analoges of algebraic properties like the isomorphisms theorems will be appeared as well.

Many applications require computational systems to respond to queries by a particular deadline. Failure to meet the deadlines may render the returned solution useless. Moreover, the deadlines of such time-critical applications are often uncertain at system design time. Anytime algorithms have been suggested to cope with these challenges by trading the quality of the solutions for the reactivene...