We deal with applicative theories which are based on combinatory logic with total application, extensionality and natural numbers. We prove a conservative extension theorem and two consistency results, involving principles of uniformity, reflection, enumeration and choice.