vided into two realms: (1) those which are computable by terminating FlooP
programs: these are said to be general recursive; and (2) those which are
computable only by nonterminating FlooP programs: these are said to be
partial recursive. (Similarly for predicates.) People often just say "recursive"
when they mean "general recursive".The Power of TNTIt is interesting that TNT is so powerful that not only are all primitive
recursive predicates represented, but moreover all general recursive predi-
cates are represented. We shall not prove either of these facts, because such
proofs would be superfluous to our aim, which is to show that TNT is
incomplete. If TNT could not represent some primitive or general recur-
sive predicates, then it would be incomplete in an uninteresting way-so we
might as well assume that it can, and then show that it is incomplete in an
interesting way.(^430) BlooP and F100P and GlooP