Lesson plan
Encompassment ordering
In theoretical computer science, in particular in automated theorem proving and term rewriting, the containment, or encompassment, preorder (≤) on the set of terms, is defined by :s ≤ t if a subterm of t is a substitution instance of s. It is used e.g. in the Knuth–Bendix completion algorithm.
Article summary
In theoretical computer science, in particular in automated theorem proving and term rewriting, the containment, or encompassment, preorder (≤) on the set of terms, is defined by :s ≤ t if a subterm of t is a substitution instance of s. It is used e.g. in the Knuth–Bendix completion algorithm.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.