Classification of Quantifier Prefixes Over Exponential Diophantine Equations
暂无分享，去创建一个
[1] Ju. V. Matijasevič,et al. Exponential Diophantine Representation of Recursively Enumerable Sets , 1982 .
[2] C. Ward Henson,et al. Correction to: “Some applications of Nevanlinna theory to mathematical logic: identities of exponential functions” [Trans. Amer. Math. Soc. 282 (1984), no. 1, 1–32; MR0728700 (85h:03015)] , 1986 .
[3] Leonard M. Adleman,et al. NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..
[4] Yu. V. Matijasevič. On Recursive Unsolvability of Hilbert's Tenth Problem , 1973 .
[5] On Skolem’s exponential functions below 2^{2^{}} , 1984 .
[6] Tung Shih-Ping. On weak number theories , 1985 .
[7] On Skolem's exponential functions below $2^2^X$ , 1984 .
[8] L. Dries. A completeness theorem for trigonometric identities and various results on exponential functions , 1986 .
[9] Lou van den Dries,et al. Exponential rings, exponential polynomials and exponential functions , 1984 .
[10] Andrzej Ehrenfeucht,et al. Polynomial functions with exponentiation are well ordered , 1973 .
[11] Daniel Richardson,et al. Roots of Real Exponential Functions , 1983 .
[12] Raphael M. Robinson,et al. Arithmetical representation of recursively enumerable sets , 1956, Journal of Symbolic Logic.
[13] Lou van den Dries,et al. Multiplex PCR amplification from the CFTR gene using DNA prepared from buccal brushes/swabs , 1986 .
[14] Angus Macintyre,et al. The laws of exponentiation , 1981 .