Chodil, M., & Kučera, A. (2025). The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable.
Chicago Style (17th ed.) CitationChodil, Miroslav, and Antonín Kučera. The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. 2025.
MLA (9th ed.) CitationChodil, Miroslav, and Antonín Kučera. The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. 2025.
Warning: These citations may not always be 100% accurate.