Diophantine Representation of Enumerable Predicates

Journal of Symbolic Logic 39 (3):605-605 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.
Diophantine equivalence and countable rings.Alexandra Shlapentokh - 1994 - Journal of Symbolic Logic 59 (3):1068-1095.
Diophantine properties of finite commutative rings.Mihai Prunescu - 2003 - Archive for Mathematical Logic 42 (3):293-302.
Arithmetical problems and recursively enumerable predicates.Martin Davis - 1953 - Journal of Symbolic Logic 18 (1):33-41.
The problem of the simplest Diophantine representation.Panu Raatikainen - 1997 - Nordic Journal of Philosophical Logic 2:47-54.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.

Analytics

Added to PP
2015-02-05

Downloads
5 (#1,546,680)

6 months
5 (#649,144)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references