Abstract
Polyadic Higher-Order Fixpoint Logic (PHFL) is a modal fixpoint logic obtained as the merger of Higher-Order Fixpoint Logic (HFL) and the Polyadic μ-Calculus. Polyadicity enables formulas to make assertions about tuples of states rather than states only. Like HFL, PHFL has the ability to formalise properties using higher-order functions. We consider PHFL in the setting of descriptive complexity theory: its fragment using no functions of higher-order is exactly the Polyadic μ-Calculus, and it is known from Otto’s Theorem that it captures the bisimulation-invariant fragment of PTIME. We extend this and give capturing results for the bisimulation-invariant fragments of EXPTIME, PSPACE, and NLOGSPACE.
The European Research Council has provided financial support under the European Community’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement no 259267.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Viswanathan, M., Viswanathan, R.: A higher order modal fixed point logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 512–528. Springer, Heidelberg (2004)
Kozen, D.: Results on the propositional μ-calculus. TCS 27, 333–354 (1983)
Axelsson, R., Lange, M., Somla, R.: The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science 3, 1–33 (2007)
Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. Complexity and Computation 7, 43–73 (1974)
Stockmeyer, L.J.: The polynomial-time hierarchy. TCS 3(1), 1–22 (1976)
Immerman, N.: Languages that capture complexity classes. SIAM Journal of Computing 16(4), 760–778 (1987)
Abiteboul, S., Vianu, V.: Computing with first-order logic. Journal of Computer and System Sciences 50(2), 309–335 (1995)
Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137–146. ACM (1982)
Immerman, N.: Relational queries computable in polynomial time. Information and Control 68(1-3), 86–104 (1986)
Immerman, N.: Descriptive Complexity. Springer, New York (1999)
Grädel, E., Kolaitis, P.G., Libkin, L., Marx, M., Spencer, J., Vardi, M.Y., Venema, Y., Weinstein, S.: Finite Model Theory and its Applications. Springer (2007)
Otto, M.: Bisimulation-invariant PTIME and higher-dimensional μ-calculus. Theor. Comput. Sci. 224(1-2), 237–265 (1999)
Andersen, H.R.: A polyadic modal μ-calculus. Technical Report 145, IT Universitetet i København (1994)
Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall (1989)
Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer (2001)
Grädel, E.: Capturing complexity classes by fragments of second-order logic. Theor. Comput. Sci. 101(1), 35–57 (1992)
Kobayashi, N., Inaba, K., Tsukada, T.: Unsafe order-2 tree languages are context-sensitive. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 149–163. Springer, Heidelberg (2014)
Lange, M., Lozes, E.: Capturing bisimulation invariant complexity classes with higher-order modal fixpoint logic, http://carrick.fmv.informatik.uni-kassel.de/~lozes/tcs14-long.pdf
Meyer, A.R., Stockmeyer, L.J.: Word problems requiring exponential time. In: STOC, pp. 1–9. ACM (1973)
Tarski, A.: A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics 5, 285–309 (1955)
Àlvarez, C., Balcázar, J.L., Gabarró, J., Santha, M.: Parallel complexity in the design and analysis on concurrent systems. In: Aarts, E.H.L., Rem, M., van Leeuwen, J. (eds.) PARLE 1991. LNCS, vol. 505, pp. 288–303. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lange, M., Lozes, E. (2014). Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds) Theoretical Computer Science. TCS 2014. Lecture Notes in Computer Science, vol 8705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44602-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-44602-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44601-0
Online ISBN: 978-3-662-44602-7
eBook Packages: Computer ScienceComputer Science (R0)