Klaimullin, Melnikov and Ng [KMNa] have recently suggested a new systematic approach to algorithms in algebra which is intermediate between computationally feasible algebra [CR91, KNRS07] and abstract computable structure theory [AK00, EG00]. In this short survey we discuss some of the key results and ideas of this new topic [KMNa, KMNc, KMNb, Ala]. We also suggest several open problems.

Given a Πμ 2 formula of the modal μ calculus, it is decidable whether it is equivalent to a Σμ 2 formula.

ACKNOWLEDGEMENT: The work of t h e second a u t h o r was supported i n p a r t by NSF g r a n t MCS-830287G.

[The pages numbers are the same as in the original edition]

In this paper subordination and inclusion relations are studied for some subclasses of multivalent meromorphic functions in the punctured unit disc having a pole of order p at the origin. The subclasses under investigation are defined through combinations and iterations of a meromorphic analogue of the Cho–Kwon–Srivastava operator for normalized analytic functions. Specially, emphasis is given ...