COMPUTABILITY AND ITS RELATION TO THE GENERAL PURPOSE ANALOG COMPUTER (SOME CONNECTIONS BETWEEN LOGIC, DIFFERENTIAL EQUATIONS AND ANALOG COMPUTERS) BY MARIAN BOYKAN POUR-EL(l) ABSTRACT. Our aim is to… Expand

Introduction. In this work we discuss recursive mappings between theories which preserve deducibility, negation and implication. Roughly, we prove that any two axiomatizable theories containing a… Expand

In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of equivalence classes of semi-effective numberings, and showed that all… Expand