The Decision Problem for Exponential Diophantine Equations

, &
Journal of Symbolic Logic 35 (1):151-152 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271205

Links

PhilArchive



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

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

Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions.Mihai Prunescu - 2006 - Mathematical Logic Quarterly 52 (1):14-19.
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
Review: Charles N. Delzell, Note on Quantifier Prefixes Over Diophantine Equations; J. P. Jones, H. Levitz, A. J. Wilkie, Classification of Quantifier Prefixes over Exponential Diophantine Equations. [REVIEW]Shih Ping Tung - 1988 - Journal of Symbolic Logic 53 (1):309-310.
A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
On the existence of a new family of diophantine equations for Ω.Toby Ord - 2003 - Fundamenta Informaticae 56:273-284.
Review: A. Nerode, A Decision Method for p-Adic Integral Zeros of Diophantine Equations. [REVIEW]Julia Robinson - 1965 - Journal of Symbolic Logic 30 (3):391-391.
Decidability of some problems pertaining to base 2 exponential diophantine equations.Hilbert Levitz - 1985 - Mathematical Logic Quarterly 31 (7‐8):109-115.
Ω in number theory.Toby Ord - 2007 - In C. S. Calude (ed.), Randomness and Complexity, from Leibniz to Chaitin. World Scientific. pp. 161-173.
Existential arithmetization of Diophantine equations.Yuri Matiyasevich - 2009 - Annals of Pure and Applied Logic 157 (2-3):225-233.
Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.
On the computational complexity of integral equations.Ker-I. Ko - 1992 - Annals of Pure and Applied Logic 58 (3):201-228.
On the decision problem for two-variable first-order logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
Review: Julia Robinson, Diophantine Decision Problems. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (3):603-603.
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.
A note on the decidability of exponential terms.Paola D'Aquino & Giuseppina Terzo - 2007 - Mathematical Logic Quarterly 53 (3):306-310.

Analytics

Added to PP
2015-02-05

Downloads
49 (#309,238)

6 months
18 (#125,972)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
Typed lambda calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 1091--1132.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references