参考书目
发表于 2025-3-26 21:38:25
On the word problem for free lattices,We prove completeness of a rewrite-based algorithm for the word problem in the variety of lattices and discuss the method of non-symmetric completion with regard to this variety.
羽饰
发表于 2025-3-27 04:54:05
http://reply.papertrans.cn/83/8300/829950/829950_32.png
GRIEF
发表于 2025-3-27 06:51:52
http://reply.papertrans.cn/83/8300/829950/829950_33.png
Clumsy
发表于 2025-3-27 09:57:58
https://doi.org/10.1007/3-540-62950-5Automatisches Schließen; Constraint-Auflösung; Monoid; Stringersetzung; Termersetzung; Theorem-Beweisen; a
FLAIL
发表于 2025-3-27 14:34:19
On the property of preserving regularity for string-rewriting systems, (1995). In particular, it is shown that it is undecidable in general whether a finite, length-reducing, and confluent stringre-writing system yields a regular set of normal forms for each regular language.
博识
发表于 2025-3-27 19:36:56
D-bases for polynomial ideals over commutative noetherian rings,escribed at an abstract level, by transition rules. Its termination is proved under certain assumptions about the strategy that controls the application of the transition rules. Correctness is established by proof simplification techniques.
谦虚的人
发表于 2025-3-28 01:39:21
http://reply.papertrans.cn/83/8300/829950/829950_37.png
JAMB
发表于 2025-3-28 02:11:35
978-3-540-62950-4Springer-Verlag Berlin Heidelberg 1997
MEEK
发表于 2025-3-28 07:57:22
http://reply.papertrans.cn/83/8300/829950/829950_39.png
粗鄙的人
发表于 2025-3-28 11:25:51
http://reply.papertrans.cn/83/8300/829950/829950_40.png