proposition: Theorem FSAT_FULL_Σ11_DEC : decidable (FSAT _ A).
proof: Proof. Proof using HP HF. destruct Sig_discrete_to_pos with (A := A) as (n & m & i & j & B & HB); auto. destruct FSAT_Σ11_DEC with (A := B) as [ H | H ]; auto. + left; apply HB; auto. + right; contradict H; apply HB; auto. Qed.
imports: List Arith Undecidability.Synthetic(Definitions ReducibilityFacts InformativeDefinitions InformativeReducibilityFacts) Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.FOL.TRAKHTENBROT(notations utils decidable discernable fol_ops fo_sig fo_terms fo_logic fo_sat fo_sat_dec red_utils Sig_Sig_fin Sig_rem_props Sig_rem_constants Sig0 Sig1 Sig1_1 Sig_discernable)