A differential-equations approach to functional equivalence

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	[1] A. Baker, 'Transcendental Number Theory', Cambridge University Press (1975).
	2	[2] G. Birkoff and G.C. Rota, 'Ordinary Differential Equations', Ginn & Co. (1962).
	3	[3] W.S. Brown, 'Rational Exponential Expressions and a Conjecture Concerning ¿ and e', Amer. Math. Monthly 76 (1969), 28-34.
	4	[4] B. Buchberger and R. Loos, 'Algebraic Simplification', in 'Computer Algebra: Symbolic and Algebraic Computation', B. Buchberger, G.E. Collins & R. Loos (eds.), 2nd edition, Springer-Verlag, Wien/New York (1983), 11-43.
	5	B. F. Caviness, On Canonical Forms and Simplification, Journal of the ACM (JACM), v.17 n.2, p.385-396, April 1970 [doi>10.1145/321574.321591]
	6	[6] B.F. Caviness, 'Methods for Symbolic Computation with Transcendantal Functions', in Proc. Conf. on Symbolic Computational Methods and Applications, St. Maximin (France)', A. Visconti (ed.) (1977), 16-43.
	7	B. F. Caviness , M. J. Prelle, A note on algebraic independence of logarithmic and exponential constants, ACM SIGSAM Bulletin, v.12 n.2, p.18-20, May 1978 [doi>10.1145/1088261.1088265]
	8	[8] J.P. Fitch, 'On Algebraic Simplification', Comput. J. 17/1 (1973), 23-27.
	9	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	10	Keith O. Geddes , Gaston H. Gonnet, A New Algorithm for Computing Symbolic Limits Using Hierarchical Series, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.490-495, July 04-08, 1988
	11	S. C. Johnson, On the Problem of Recognizing Zero, Journal of the ACM (JACM), v.18 n.4, p.559-565, Oct. 1971 [doi>10.1145/321662.321669]
	12	[12] S. Lang, 'Transcendental Numbers and Diophantine Approximation', Bull. Amer. Math. Soc. 77/5 (1971), 635-677.
	13	William A. Martin, Determining the Equivalence of Algebraic Expressions by Hash Coding, Journal of the ACM (JACM), v.18 n.4, p.549-558, Oct. 1971 [doi>10.1145/321662.321668]
	14	[14] Yu. V. Matijacevic, 'Enumerable Sets are Diophantine', Sov. Math. Dokl. 11 (1970), 453-458.
	15	Joel Moses, Algebraic simplification: a guide for the perplexed, Communications of the ACM, v.14 n.8, p.527-537, Aug. 1971 [doi>10.1145/362637.362648]
	16	A. C. Norman, Computing in transcendental extensions., Computer algebra: symbolic and algebraic computation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1983
	17	Arthur E. Oldehoeft, Analysis of constructed mathematical responses by numeric tests for equivalence, Proceedings of the 1969 24th national conference, p.117-124, August 26-28, 1969 [doi>10.1145/800195.805923]
	18	[18] D. Richardson, 'Some Undecidable Problems Involving Elementary Functions of a Real Variable', J. Symbolic Logic 33 (1968), 514-520.
	19	[19] M. Rothstein and B.F. Caviness, 'A Structure Theorem for Exponential and Primitive Functions', SIAM J. Comput. 8/3 (1979), 357-367.
	20	[20] J.R. Shackell, 'Growth Estimates for Exp-Log Functions', preprint 1987.
	21	[21] J.R. Shackell, 'Zero-equivalence in function fields defined by algebraic differential equations', preprint 1989.