APA (7th ed.) Citation

Fortin, M., Kuijer, L. B., Totzke, P., & Zimmermann, M. (2025). HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ is Even Harder. Logical methods in computer science, 21, Issue 1, . https://doi.org/10.46298/lmcs-21(1:3)2025

Chicago Style (17th ed.) Citation

Fortin, Marie, Louwe B. Kuijer, Patrick Totzke, and Martin Zimmermann. "HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ Is Even Harder." Logical Methods in Computer Science 21, Issue 1 (2025). https://doi.org/10.46298/lmcs-21(1:3)2025.

MLA (9th ed.) Citation

Fortin, Marie, et al. "HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ Is Even Harder." Logical Methods in Computer Science, vol. 21, Issue 1, 2025, https://doi.org/10.46298/lmcs-21(1:3)2025.