fact: Fixpoint L_ded {p : peirce} {b : falsity_flag} (A : list form) (n : nat) : list form := match n with | 0 => A | S n => L_ded A n ++ concat ([ [ phi → psi | psi ∈ L_ded (phi :: A) n ] | phi ∈ L_T form n ]) ++ [ psi | (phi, psi) ∈ (L_ded A n × L_T form n) , (phi → psi el L_ded A n) ] ++ [ ∀ phi | phi ∈ L_ded (map (subst_form ↑) A) n ] ++ [ phi[t..] | (phi, t) ∈ (L_T form n × L_T term n), (∀ phi) el L_ded A n ] ++ (match b with falsity_on => fun A => [ phi | phi ∈ L_T form n, ⊥ el @L_ded _ falsity_on A n ] | _ => fun _ => nil end A) ++ (if p then [ (((phi → psi) → phi) → phi) | (pair phi psi) ∈ (L_T form n × L_T form n) ] else nil) end.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability.FOL(Syntax.Facts Syntax.Theories Syntax.Asimpl) Undecidability(Shared.ListAutomation) Lia EqdepFacts