1. McCarthy, J., Representation of Recursive Programs in First Order Logic, Computer Science Department, Stanford University, Stanford, 1977.
2. Maher, J., “Complete axiomatizations of the algebras of finite, infinite and rational trees,” pp. 348–357 in Proceedings of the Third Annual Symposium on Logic in Computer Science, IEE Computer Society, New York, 1988.
3. Marongiu, G., and S. Tulipani, “Quantifier elimination for infinite terms,” Archives of Mathematical Logic, vol. 31 (1991), pp. 1–17. Zbl 0723.03016 MR 92i:03029
4. Marongiu, G., and S. Tulipani, Decidability results for term algebras, AILA Preprint, 1991.
5. Marongiu, G., and S. Tulipani, “Undecidable fragments of term algebras with subterm relation,” Fundamenta Informaticae, vol. 19 (1993), pp. 371–382. Zbl 0788.03011 MR 95f:68145