About the theory of tree embedding
Authors:
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 376-390
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Satisfiability of systems of ordinal notations with the subterm property is decidableLecture Notes in Computer Science, 1991
- Rewrite Systems1990
- Decidability of the purely existential fragment of the theory of term algebrasJournal of the ACM, 1987
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952