Abstract: | In a countable, recursively saturated model of Peano Arithmetic, an interstice is a maximal convex set which does not contain any definable elements. The interstices are partitioned into intersticial gaps in a way that generalizes the partition of the unbounded interstice into gaps. Continuing work of Bamber and Kotlarski [1], we investigate extensions of Kotlarski's Moving Gaps Lemma to the moving of intersticial gaps. |