摘要：A property of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS has the property if and only if its underlying unsorted TRS has the property . This notion was introduced by H. Zantema (1994). In this paper, it is shown that confluence is persistent. 1.) Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science, special issue editors D.S. Bridges, C.S. Calude, M.J. Dinneen and B. Khoussainov.
