proposition: Lemma minKripkeSatisfiabilityUndec : undecidable (fun k : minimalForm falsity_on => ksatis k).
proof: Proof. apply (undecidability_from_reducibility H10UPC_SAT_compl_undec). apply kripkeSatisReduction. Qed.
imports: Undecidability.DiophantineConstraints(H10C H10C_undec) Undecidability.FOL.Syntax(Core BinSig) Undecidability.Synthetic(Definitions Undecidability ReducibilityFacts)