(1) ∀u, k∀v ≤ρ tuk∃w A0(u, k, v, w), where A0 is a quantifier–free formula 1 (containing only u, k, v, w as free variables) in the language of a suitable subsystem T ω of arithmetic in all finite types, t is a closed term and ≤ρ is defined pointwise (ρ being an arbitrary finite type). Lets suppose that (1) is provable in T . Then from a given such proof one can extract an effective uniform boun...