Miroslav Chodil, Antonín Kucera 0001. The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. In Keren Censor Hillel, Fabrizio Grandoni 0001, Joël Ouaknine, Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8-11, 2025, Aarhus, Denmark. Volume 334 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. [doi]
Abstract is missing.