Decidability of some Problems Pertaining to Base 2 Exponential Diophantine Equations

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (7-8):109-115 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19850310703

Links

PhilArchive



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

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

Decidability of some problems pertaining to base 2 exponential diophantine equations.Hilbert Levitz - 1985 - Mathematical Logic Quarterly 31 (7‐8):109-115.
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.
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.
Classification of Quantifier Prefixes Over Exponential Diophantine Equations.J. P. Jones, H. Levitz & A. J. Wilkie - 1986 - Mathematical Logic Quarterly 32 (25-30):399-406.
A note on the decidability of exponential terms.Paola D'Aquino & Giuseppina Terzo - 2007 - Mathematical Logic Quarterly 53 (3):306-310.
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
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.
The Decision Problem for Exponential Diophantine Equations.Martin Davis, Hilary Putnam & Julia Robinson - 1970 - Journal of Symbolic Logic 35 (1):151-152.
On the existence of a new family of diophantine equations for Ω.Toby Ord - 2003 - Fundamenta Informaticae 56:273-284.
Ω 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.
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.
On the computational complexity of integral equations.Ker-I. Ko - 1992 - Annals of Pure and Applied Logic 58 (3):201-228.
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.

Analytics

Added to PP
2015-12-02

Downloads
22 (#692,982)

6 months
1 (#1,516,429)

Historical graph of downloads
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