Note on Quantifier Prefixes Over Diophantine Equations.Classification of Quantifier Prefixes over Exponential Diophantine Equations

Journal of Symbolic Logic 53 (1):309-310 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274452

Links

PhilArchive



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

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

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.
Note on Quantifier Prefixes Over Diophantine Equations.Charles N. Delzell - 1986 - Mathematical Logic Quarterly 32 (25‐30):395-397.
Correction to “Note on Quantifier Prefixes Over Diophantine Equations”.Charles N. Delzell - 1988 - Mathematical Logic Quarterly 34 (3):283-286.
Note on Quantifier Prefixes Over Diophantine Equations.Charles N. Delzell - 1986 - Mathematical Logic Quarterly 32 (25-30):395-397.
Correction to “Note on Quantifier Prefixes Over Diophantine Equations”.Charles N. Delzell - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (3):283-286.
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.
Classification of Quantifier Prefixes Over Diophantine Equations.James P. Jones - 1981 - Mathematical Logic Quarterly 27 (25‐30):403-410.
Classification of Quantifier Prefixes Over Diophantine Equations.James P. Jones - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (25-30):403-410.
Classification of Quantifier Prefixes Over Diophantine Equations.Some Diophantine Forms of Godel's Theorem.Universal Diophantine Equation.Exponential Diophantine Representation of Recursively Enumerable Sets.Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets.James P. Jones, Verena H. Dyson, John C. Shepherdson & J. P. Jones - 1986 - Journal of Symbolic Logic 51 (2):477-479.
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.
Existential arithmetization of Diophantine equations.Yuri Matiyasevich - 2009 - Annals of Pure and Applied Logic 157 (2-3):225-233.
Decidability of some problems pertaining to base 2 exponential diophantine equations.Hilbert Levitz - 1985 - Mathematical Logic Quarterly 31 (7‐8):109-115.
Decidability of some Problems Pertaining to Base 2 Exponential Diophantine Equations.Hilbert Levitz - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (7-8):109-115.
The diversity of quantifier prefixes.H. Jerome Keisler & Wilbur Walkoe - 1973 - Journal of Symbolic Logic 38 (1):79-85.
On the existence of a new family of diophantine equations for Ω.Toby Ord - 2003 - Fundamenta Informaticae 56:273-284.

Analytics

Added to PP
2016-06-30

Downloads
14 (#995,492)

6 months
2 (#1,206,195)

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