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 Gamma in the class; thus they are equivalent in Gamma 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. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
