About the theory of tree embedding

DOI10.1007/3-540-56610-4_77MaRDI QIDQ5044749zbMATH OpenOpenAlexFDO

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

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

Cites work

• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• Ordering by Divisibility in Abstract Algebras
• Satisfiability of systems of ordinal notations with the subterm property is decidable
• SOLVING SYMBOLIC ORDERING CONSTRAINTS
• Theorem proving with ordering constrained clauses

Cited in

(6)

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

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)