58 search results - page 1 / 12 » Weakly maximal decidable structures |
ITA
2008
13 years 5 months ago
2008
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...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
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...
DNA
2004
Springer
13 years 10 months ago
2004
Springer
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...
ESSLLI
1999
Springer
13 years 9 months ago
1999
Springer
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...
CIE
2005
Springer
13 years 11 months ago
2005
Springer
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...