On collection schemes and Gaifman's splitting theorem
Abstract
We study model theoretic characterizations of various collection schemes over PA- from the viewpoint of Gaifman's splitting theorem. Among other things, we prove that for any n ≥ 0 and M PA-, the following are equivalent: 1. M satisfies the collection scheme for n+1 formulas. 2. For any K, N PA-, if M ⊂eqcof K, M _0 K and M N, then M _n+2 K and N(M) _n N. 3. For any N PA-, if M N, then M _n+2 N(M) _n N. Here, N(M) is the unique K satisfying M ⊂eqcof K ⊂eqend N. We also investigate strong collection schemes and parameter-free collection schemes from the similar perspective.
0