Encompassment ordering
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
Properties
Encompassment is a preorder, i.e. reflexive and transitive, but not anti-symmetric, nor total The corresponding equivalence relation, defined by s ~ t if s ≤ t ≤ s, is equality modulo renaming. s ≤ t whenever s is a subterm of t. s ≤ t whenever t is a substitution instance of s. The union of any well-founded rewrite order R with (<) is well-founded, where (<) denotes the irreflexive kernel of (≤). In particular, (<) itself is well-founded.
Notes
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1379018410 under CC BY-SA 4.0; modifications have been made.