Cita APA (7a ed.)

Chodil, M., & Kučera, A. (2025). The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable.

Cita Chicago Style (17a ed.)

Chodil, Miroslav, y Antonín Kučera. The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. 2025.

Cita MLA (9a ed.)

Chodil, Miroslav, y Antonín Kučera. The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. 2025.