📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder (2025)

First Author: Fortin M

Attributed to: COSTRA -- The Cost of Winning Strategies funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.46298/lmcs-21(1:3)2025

Publication URI: http://dx.doi.org/10.46298/lmcs-21(1:3)2025

Type: Journal Article/Review

Parent Publication: Logical Methods in Computer Science