Switch to: Citations

Add references

You must login to add references.
  1. Universal diophantine equation.James P. Jones - 1982 - Journal of Symbolic Logic 47 (3):549-571.
  • Register machine proof of the theorem on exponential diophantine representation of enumerable sets.J. P. Jones & Y. V. Matijasevič - 1984 - Journal of Symbolic Logic 49 (3):818-829.
  • On Suppes' Set Theoretical Predicates.Newton C. A. da Costa & Rolando Chuaqui - 1988 - Erkenntnis 29 (1):95-112.
  • Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications.N. C. A. Da Costa & F. A. Doria - 1995 - Complexity 1 (3):40-55.
  • The undecidability of formal definitions in the theory of finite groups.Newton Ca da Costa, Francisco A. Doria & Marcelo Tsuji - 1995 - Bulletin of the Section of Logic 24:56-63.
  • On the Existence of Very Difficult Satisfiability Problems.N. C. A. da Costa & F. A. Doria - forthcoming - Bulletin of the Section of Logic.