At first sight, recursive saturation may seem an ‘unhappy marriage’ between model theory and recursion theory, as some authors put it. Nevertheless, it turns out to work wonderfully well with models of arithmetic. First and most important of all, since there are only countably many recursive sets, the number of recursive types over any infinite structure M is exactly card(M). So by an elementar...