Abstract

In this paper we prove that the preordering ≲ of provable implication over any recursively enumerable theory T containing a modicum of arithmetic is uniformly dense. This means that we can find a recursive extensional density function F for ≲. A recursive function F is a density function if it
... read more