Abstract
One of the major goals of descriptive complexity theory is to study the relationship of the expressive power of various logics. The motivation is that results relating the expressive power of logics may help to answer questions like “Is a given query expressible in some logic?” more easily. It may also help to explain why it is hard to express a given query in some logic. Answers to those questions, on the other hand, are highly relevant as they have an immediate impact on the amount of resources necessary to answer a query, due to the close connection between logics and traditional computational complexity classes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Squirrels usually make provisions for every possible future, at least in literary fiction (see, e.g., [Pot03]).
- 2.
Observe that this fails for the classes
and 
. - 3.
This method cannot be used for \(\textsc {DynCQ} \) and
. - 4.
This cannot be guaranteed for
.
and 
.
.
.Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this chapter
Cite this chapter
Zeume, T. (2017). Relating Small Dynamic Complexity Classes. In: Small Dynamic Complexity Classes. Lecture Notes in Computer Science(), vol 10110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54314-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-54314-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-54313-9
Online ISBN: 978-3-662-54314-6
eBook Packages: Computer ScienceComputer Science (R0)