Symbolic transition systems separate data from process behaviour by allowing the data to be uninstantiated Designing a HML like modal logic for these transition systems is interesting because of the subtle interplay between the quanti ers for the data and the modal operators quanti ers on transitions This paper presents the syntax and semantics of such a logic and discusses the design issues in...

This paper shows how certain robust multi objective feedback design problems can be reduced to quanti er elimination QE problems In particular it is shown how robust stabilization and robust frequency domain performance speci cations can be reduced to systems of polynomial inequalities with suitable logic quanti ers and Because of computational complexity the size of problems that can solved by...

Binary NP consists of all sets of nite structures which are expressible in existential second order logic with second order quanti cation restricted to relations of arity 2. We look at semantical restrictions of binary NP, where the second order quanti ers range only over certain classes of relations. We consider mainly three types of classes of relations: unary functions, order relations and g...

This paper applies techniques of algebraic approximation to provide e ective algorithms to determine the validity of universally quanti ed implications over lattice structures. We generalize the known result which states that any semilattice is approximated in the two element lattice. We show that the validity of a universally quanti ed implication over a possibly in nite domain can be determin...