Definition cLam s := lambda(lambda(lambda(0 s))).

(* Specifications: *)
Lemma totality : ~ recognisable (fun s => proc s /\ forall t, eva(s (tenc t))).
Theorem totality_hard : ~ recognisable (fun s => forall t, pi s t) /\ ~ recognisable (fun s => ~ forall t, pi s t).
Lemma H_test s : test (H (tenc s)).
Lemma H_inv n s : satis ( H (tenc s) ) n -> eval n s <> None.
Lemma H_proc s : proc (H (tenc s)).
Lemma U_sound s : eva (U (tenc s)) -> eva s.
Lemma U_eva s : eva s <-> eva (U (tenc s)).
Lemma recognisable_eva : recognisable eva.