Abstract
We formalize basic results on first-order terms, including matching and a
first-order unification algorithm, as well as well-foundedness of the
subsumption order. This entry is part of the Isabelle
Formalization of Rewriting IsaFoR,
where first-order terms are omni-present: the unification algorithm is
used to certify several confluence and termination techniques, like
critical-pair computation and dependency graph approximations; and the
subsumption order is a crucial ingredient for completion.
License
Topics
Session First_Order_Terms
- Transitive_Closure_More
- Seq_More
- Fun_More
- Option_Monad
- Term
- Term_Pair_Multiset
- Abstract_Matching
- Unifiers
- Abstract_Unification
- Unification
- Matching
- Subsumption
Depends on
Used by
- A Formalization of the SCL(FOL) Calculus: Simple Clause Learning for First-Order Logic
- Extensions to the Comprehensive Framework for Saturation Theorem Proving
- A Formalization of Knuth–Bendix Orders
- Stateful Protocol Composition and Typing
- A Verified Functional Implementation of Bachmair and Ganzinger’s Ordered Resolution Prover
- The Resolution Calculus for First-Order Logic