If you need an accessible version of this item please contact JSTOR User Support

Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets

J. P. Jones and Y. V. Matijasevič
The Journal of Symbolic Logic
Vol. 49, No. 3 (Sep., 1984), pp. 818-829
DOI: 10.2307/2274135
Stable URL: http://www.jstor.org/stable/2274135
Page Count: 12
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets
Preview not available

Page Thumbnails

  • Thumbnail: Page 
818
    818
  • Thumbnail: Page 
819
    819
  • Thumbnail: Page 
820
    820
  • Thumbnail: Page 
821
    821
  • Thumbnail: Page 
822
    822
  • Thumbnail: Page 
823
    823
  • Thumbnail: Page 
824
    824
  • Thumbnail: Page 
825
    825
  • Thumbnail: Page 
826
    826
  • Thumbnail: Page 
827
    827
  • Thumbnail: Page 
828
    828
  • Thumbnail: Page 
829
    829