We explore some analogies between the computable binary branching tree $T_{PA}$ whose paths represent the completions of first order Peano Arithmetic, and a computable infinitely branching tree $T_{KP}$ whose paths represent the complete diagrams of $\omega$-models of Kripke-Platek set theory.

This is joint work with Rose Weisshaar and Dan Turetsky.