From Undecidability.L.Computability Require Export Fixpoints Decidability Seval.
From Undecidability.L.Functions Require Export Proc Encoding.
(* * Scott's Theorem *)

Theorem Scott (M : term -> Prop) : M <=1 closed ->
(forall s t, M s -> closed t -> t == s -> M t) ->
(exists t1, closed t1 /\ M t1) -> (exists t2, closed t2 /\ ~ M t2) ->
~ ldec M.