A formalised first-order confluence proof for the -calculus using one-sorted variable names.
René VestergaardJames BrotherstonPublished in: Inf. Comput. (2003)
Keyphrases
- term rewriting
- rewrite systems
- first order logic
- proof procedure
- theorem proving
- natural deduction
- automated theorem proving
- proof search
- sequent calculus
- theorem prover
- provably correct
- higher order
- cut elimination
- predicate calculus
- inference rules
- keywords
- linear logic
- proof theoretic
- decision procedures
- computer algebra
- mental states
- modal logic
- expressive power
- stochastic dominance
- complete axiomatization
- mathematical proofs