Abstract
All the disappointing news comes in this chapter: even for a very restricted subset of DC formulas, it is undecidable whether a formula in the subset is satisfiable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chaochen, Z., Hansen, M.R. (2004). Undecidability. In: Duration Calculus. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06784-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-06784-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07404-2
Online ISBN: 978-3-662-06784-0
eBook Packages: Springer Book Archive