The powerset construction is a standard method for converting a non-deterministic automaton into an equivalent deterministic one as far as language is concerned. In this short paper, we lift the powerset construction on automata to the more general framework of coalgebras with enriched state spaces. Examples of applications includes transducers, and Rabin probabilistic automata.

Abstract We prove that the existence of a measurable cardinal is equivalent to normal space whose modal logic coincides with Kripke frame isomorphic powerset two element set.

We prove the decidability for a class of languages which extend BST and NP-completeness subclass them. The extended with unordered cartesian product, ordered product powerset fall in this last subclass.

Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study sparse equations, which are equations with at most polynomially many solutions. We look at their complexity...

Abstrac t -The relational model is extended to include nested structures. This extension is formalised using the distinction between a tuple scheme and a relation scheme. The algebra and calculus languages are defined for this model. It is shown that the restricted powerset is a derived operation in the algebra and the full powerset is expressible by a safe forraula in the calculus. Since the f...

Lafont 11] gives an elegant proof of nite model property (fmp) for Multiplicative-Additive Linear Logic (MALL) and suggests it can be adapted to noncommutative linear logics of Abrusci 1]. In 4, 6, 9], fmp for certain fragments of MALL (e.g. BCI, BCII^]) and weaker systems (e.g. the product-free Lambek calculus) has been proven by a diierent method; whereas Lafont uses phase space models and qu...