  The general/finite PCTL satisfiability problem asks whether a given PCTL
formula has a general/finite model. We show that the finite PCTL satisfiability
problem is undecidable, and the general PCTL satisfiability problem is even
highly undecidable (beyond the arithmetical hierarchy). Consequently, there are
no sound deductive systems proving all generally/finitely valid PCTL formulae.
