The problem of the simplest Diophantine representation

Nordic Journal of Philosophical Logic 2:47-54 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

My notes

Similar books and articles

On the existence of a new family of diophantine equations for Ω.Toby Ord - 2003 - Fundamenta Informaticae 56:273-284.
Diophantine equivalence and countable rings.Alexandra Shlapentokh - 1994 - Journal of Symbolic Logic 59 (3):1068-1095.
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
Hilbert's Tenth Problem for Rings of Rational Functions.Karim Zahidi - 2002 - Notre Dame Journal of Formal Logic 43 (3):181-192.
Diophantine properties of finite commutative rings.Mihai Prunescu - 2003 - Archive for Mathematical Logic 42 (3):293-302.
Diophantine definability over non-finitely generated non-degenerate modules of algebraic extensions of ℚ.Alexandra Shlapentokh - 2001 - Archive for Mathematical Logic 40 (4):297-328.
Review: Ju. V. Matijasevic, R. N. Gross, Diophantine Representation of the Set of Prime Numbers. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):607-607.
Review: Yu. V. Matijasevic, Diophantine Representation of Recursively Enumerable Predicates. [REVIEW]Alonzo Church - 1972 - Journal of Symbolic Logic 37 (3):606-607.
Review: Ju. V. Matijasevic, F. M. Goldware, Diophantine Representation of Enumerable Predicates. [REVIEW]Martin Davis - 1974 - Journal of Symbolic Logic 39 (3):605-605.
Review: Yu. V. Matijasevic, J. E. Fenstad, Diophantine Representation of Recursively Enumerable Predicates. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):606-606.
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.
Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly.Edward G. Belaga & Maurice Mignotte - 2006 - Discrete Mathematics and Theoretical Computer Science.
An object-oriented view on problem representation as a search-efficiency facet: Minds vs. machines. [REVIEW]Reza Zamani - 2010 - Minds and Machines 20 (1):103-117.
Review: James Ax, Simon Kochen, Diophantine Problems Over Local Fields I; James Ax, Simon Kochen, Diophantine Problems Over Local Fields II. A Complete set of Axioms for $p$-adic number theory; James Ax, Simon Kochen, Diophantine Problems over Local Field III. Decidable Fields. [REVIEW]Abraham Robinson - 1971 - Journal of Symbolic Logic 36 (4):683-684.

Analytics

Added to PP
2014-03-28

Downloads
24 (#620,575)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Panu Raatikainen
Tampere University

Citations of this work

On explicating the concept the power of an arithmetical theory.Jörgen Sjögren - 2008 - Journal of Philosophical Logic 37 (2):183 - 202.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Constructivism in mathematics: an introduction.A. S. Troelstra - 1988 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.. Edited by D. van Dalen.
On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
Mathematical significance of consistency proofs.G. Kreisel - 1958 - Journal of Symbolic Logic 23 (2):155-182.

View all 7 references / Add more references