Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Richardson, D.
1969.
Solution of the identity problem for integral exponential functions.
Mathematical Logic Quarterly,
Vol. 15,
Issue. 20-22,
p.
333.
Caviness, B. F.
1970.
On Canonical Forms and Simplification.
Journal of the ACM,
Vol. 17,
Issue. 2,
p.
385.
Johnson, S. C.
1971.
On the Problem of Recognizing Zero.
Journal of the ACM,
Vol. 18,
Issue. 4,
p.
559.
Caviness, B. F.
and
Collins, G. E.
1972.
Symbolic mathematical computation in a Ph. D. computer science program.
ACM SIGCSE Bulletin,
Vol. 4,
Issue. 1,
p.
19.
Barton, D
and
Fitch, J P
1972.
Applications of algebraic manipulation programs in physics.
Reports on Progress in Physics,
Vol. 35,
Issue. 1,
p.
235.
Moses, Joel
1972.
Towards a general theory of special functions.
Communications of the ACM,
Vol. 15,
Issue. 7,
p.
550.
Jones, James P.
1974.
Recursive Undecidability — An Exposition.
The American Mathematical Monthly,
Vol. 81,
Issue. 7,
p.
724.
Kreisel, G.
1974.
A notion of mechanistic theory.
Synthese,
Vol. 29,
Issue. 1-4,
p.
11.
Schmidt, Peter
1976.
GI — 6. Jahrestagung.
p.
442.
Kreisel, G.
1976.
Logic and Probability in Quantum Mechanics.
p.
3.
Brown, W.S.
and
Hearn, A.C.
1979.
Applications of symbolic algebraic computation.
Computer Physics Communications,
Vol. 17,
Issue. 1-2,
p.
207.
Epstein, H. I.
and
Caviness, B. F.
1979.
A structure theorem for the elementary functions and its application to the identity problem.
International Journal of Computer & Information Sciences,
Vol. 8,
Issue. 1,
p.
9.
Uspensky, V. A.
and
Semenov, A. L.
1981.
Algorithms in Modern Mathematics and Computer Science.
Vol. 122,
Issue. ,
p.
100.
Buchberger, B.
and
Loos, R.
1983.
Computer Algebra.
Vol. 4,
Issue. ,
p.
11.
Henson, C. Ward
and
Rubel, Lee A.
1984.
Some applications of Nevanlinna theory to mathematical logic: identities of exponential functions.
Transactions of the American Mathematical Society,
Vol. 282,
Issue. 1,
p.
1.
Borodin, Allan
Fagin, Ronald
Hopcroft, John E.
and
Tompa, Martin
1985.
Decreasing the nesting depth of expressions involving square roots.
Journal of Symbolic Computation,
Vol. 1,
Issue. 2,
p.
169.
van den Dries, Lou
1986.
A completeness theorem for trigonometric identities and various results on exponential functions.
Proceedings of the American Mathematical Society,
Vol. 96,
Issue. 2,
p.
345.
Davis, Ernest
1987.
Constraint propagation with interval labels.
Artificial Intelligence,
Vol. 32,
Issue. 3,
p.
281.
Richardson, Daniel
1988.
Non Standard Models of the Theory of Elementary Functions of a Real Variable.
Mathematical Logic Quarterly,
Vol. 34,
Issue. 4,
p.
355.
Fateman, Richard
Bundy, Alan
O'Keefe, Richard
and
Sterling, Leon
1988.
Commentary on: solving symbolic equations with PRESS.
ACM SIGSAM Bulletin,
Vol. 22,
Issue. 2,
p.
27.