Logic in Computer Science (LICS 1989)

Paper: Some complexity bounds for dynamic logics (at LICS 1989)

Authors: Stolboushkin, A.P.

Abstract

The class of so called Adian's structures with pairwise different exponents is considered. It is known that both deterministic dynamic logic (DDL) and context-free DDL (CF-DDL) have an unwind property in every structure Γ in the class; thus they are equivalent in Γ to first-order logic. None the less, it turns out that these three logics have different complexity bounds in the class. The main result is to prove polynomial upper bounds for DDL formulas. As a corollary, the authors find the DDL and CF-DDL are unequivalent to one another in the class. The proof remains valid even in the presence of elementary tests and rich tests

BibTeX

  @InProceedings{Stolboushkin-Somecomplexitybound,
    author = 	 {Stolboushkin, A.P.},
    title = 	 {Some complexity bounds for dynamic logics},
    booktitle =  {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989},
    year =	 1989,
    editor =	 {Rohit Parikh},
    month =	 {June}, 
    pages =      {324--332},
    location =   {Pacific Grove, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }