The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable

Documenti analoghi

• The General and Finite Satisfiability Problems for PCTL are Undecidable
  di: Chodil, Miroslav, et al.
  Pubblicazione: (2024)
• HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
  di: Fortin, Marie, et al.
  Pubblicazione: (2023)
• Undecidability of Linear Logics without Weakening
  di: Suzuki, Jun, et al.
  Pubblicazione: (2025)
• On the Satisfiability of Local First-Order Logics with Data
  di: Bollig, Benedikt, et al.
  Pubblicazione: (2023)
• The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
  di: Pratt-Hartmann, Ian
  Pubblicazione: (2017)