We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
Lila Kari, Stavros Konstantinidis, Petr Sosí...
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...