From Undecidability.L Require Export Enumerable InterpreterResults DecidableRecognisable Rice Por.
(** * Markov's principle *)

(* Specifications: *)
Lemma re_exists p : enumerable p -> enumerable (fun t => exists s : term, p (s t)).
Lemma DA p : recognisable p -> recognisable (fun _ => exists t, p t).
Definition Markov_Post:= forall p, recognisable p -> recognisable (complement p) -> decidable p.