Classification of Quantifier Prefixes Over Exponential Diophantine Equations

, &
Mathematical Logic Quarterly 32 (25-30):399-406 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19860322504

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

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.
Charles N. Delzell. Note on quantifier prefixes over diophantine equations. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 32 , pp. 395–397. - J. P. Jones, H. Levitz, and A. J. Wilkie. Classification of quantifier prefixes over exponential diophantine equations. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 32 , pp. 399–406. [REVIEW]Shih Ping Tung - 1988 - Journal of Symbolic Logic 53 (1):309-310.
Classification of Quantifier Prefixes Over Diophantine Equations.James P. Jones - 1981 - Mathematical Logic Quarterly 27 (25‐30):403-410.
Note on Quantifier Prefixes Over Diophantine Equations.Classification of Quantifier Prefixes over Exponential Diophantine Equations.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.
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.
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.
Classification of Quantifier Prefixes Over Diophantine Equations.James P. Jones - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (25-30):403-410.
Verena H. Dyson, James P. Jones, and John C. Shepherdson. Some diophantine forms of Gödel's theorem. Archiv für mathematische Logik und Grundlagenforschung, vol. 22 , pp. 51–60. - James P. Jones. Universal diophantine equation. The journal of symbolic logic, vol. 47 , pp. 549–571. - J. P. Jones and Ju. V. Matijasevič. Exponential diophantine representation of recursively enumerable sets. English with French abstract. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium held in Marseilles, France, July 1981, edited by J. Stern, Studies in logic and the foundations of mathematics, vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, pp. 159–177. - J. P. Jones and Y. V. Matijasevič. Register machine proof of the theorem on exponential diophantine representation of enumerable sets. The journal of symbolic logic, vol. 49 , pp. 818–829. [REVIEW]Martin Davis - 1986 - Journal of Symbolic Logic 51 (2):477-479.

Analytics

Added to PP
2013-12-01

Downloads
34 (#484,999)

6 months
9 (#355,594)

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

Add more references