Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

Voted

CSL
2008
Springer

favoriteEmaildiscussreport

121views Automated Reasoning» more CSL 2008»

Model Transformations in Decidability Proofs for Monadic Theories

14 years 11 months ago

Model Transformations in Decidability Proofs for Monadic Theories

Download www-i7.informatik.rwth-aachen.de

We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (given for example by the restriction to formulas of a certain quantifier rank) and

Wolfgang Thomas

Real-time Traffic

Automated Reasoning | Basic Techniques | Certain Quantifier Rank | CSL 2008 | Monadic Second-order Theory |

claim paper

Related Content

» Deciding Full Branching Time Logic by Program Transformation

» On decidability of monadic logic of order over the naturals extended by monadic predicates

» Covering of ordinals

» Monadic Chain Logic Over Iterations and Applications to Pushdown Systems

» Monadic datalog over finite structures with bounded treewidth

» Transforming structures by set interpretations

» Composition of Path Transductions

» On Decidability Properties of Local Sentences

» Cosmological lower bound on the circuit complexity of a small problem in logic

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CSL
Authors	Wolfgang Thomas

Comments (0)