About the theory of tree embedding

DOI10.1007/3-540-56610-4_77zbMATH Open1497.03029OpenAlexW2107850390MaRDI QIDQ5044749FDOQ5044749

Authors: Alexandre Boudet, Hubert Comon 

Publication date: 2 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_77

Mathematics Subject Classification ID

Trees (05C05) Decidability of theories and sets of sentences (03B25)

Cites Work

• Title not available (Why is that?)
• Ordering by Divisibility in Abstract Algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

Cited In (6)

• Higher-order annotated terms for proof search
• The first-order theory of lexicographic path orderings is undecidable
• More problems in rewriting
• Basic theory of feature trees
• Solving simplification ordering constraints
• Problems in rewriting III

This page was built for publication: About the theory of tree embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044749)