Functions provably total in
A partition theorem for α-large sets
Some combinatorics involving ξ-large sets
We prove a version of the Ramsey theorem for partitions of (increasing) n-tuples. We derive this result from a version of König's infinity lemma for ξ-large trees. Here ξ < ε₀ and the notion of largeness is in the sense of Hardy hierarchy.
On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic
We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.
Page 1