proposition: Theorem informative_completeness s : ( prv (~~: s) ) + (exists2 M : fmodel, #|M| <= f_size s * 2^(4 * f_size s + 2) & exists (w:M), eval s w).
proof: Proof. exact: informative_completeness. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.CTL(CTL_def dags demo agreement hilbert hilbert_ref hilbert_LS hilbert_Eme90) CompDecModal.CTL(gen_def gen_dec gen_hsound gen_ref)