• Publications
  • Influence
Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers)
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 toExpand
  • 163
  • 11
  • PDF
Deduction-preserving "Recursive Isomorphisms" between theories
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 aExpand
  • 44
  • 1
  • PDF
Review: Gerald E. Sacks, On the Degrees Less than 0'
  • 9
  • 1
Gödel numberings versus Friedberg numberings
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 allExpand
  • 19
  • PDF
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
On etudie la structure de calculabilite des valeurs propres et du spectre d'operateurs lineaires bornes et non bornes sur un espace de Hilbert
  • 7