proposition: Theorem FSAT_FULL_MONADIC_DEC A : decidable (FSAT Σ A).
proof: Proof. Proof using H4 H3 H2 H1. destruct FSAT_FULL_MONADIC_FSAT_11 with Σ as (f & Hf); auto. destruct FSAT_FULL_Σ11_DEC with (A := f A) as [ H | H ]; auto. + left; apply Hf, H. + right; contradict H; apply Hf, H. 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)