fact: Fixpoint bounded_pred ar n (phi : form) := match phi with | @atom _ _ _ ar' (var_pred x) _ => n > x \/ ar <> ar' | atom (pred _) _ => True | fal => True | bin _ phi psi => bounded_pred ar n phi /\ bounded_pred ar n psi | quant_indi _ phi => bounded_pred ar n phi | quant_func _ _ phi => bounded_pred ar n phi | quant_pred _ ar' phi => (ar = ar' /\ bounded_pred ar (S n) phi) \/ (ar <> ar' /\ bounded_pred ar n phi) end.
imports: Undecidability.SOL.SOL Undecidability.Shared.Dec Undecidability.Shared.Libs.PSL(Vectors) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) EqdepFacts Eqdep_dec