[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]
# 15-815 Automated Theorem Proving

# Lecture 32: Ordering

The use of orders to eliminate redundancy is critical in theorem proving,
particularly when equality is present. We introduce various properties we
would like orders to have an introduce the *lexicographic path
ordering* which is based on a precedence among function symbols and
constants.

### Reading

### Key Concepts

- Stable order
- Monotonic order
- Subterm property
- Rewrite ordering
- Reduction order
- Simplification order
- Lexicographic path order

### Links

[ home
| schedule
| assignments
| projects
| resources
| handouts
| overview
| links
]

Frank Pfenning
fp@cs