We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...