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

# Lecture 22: Classical Logic

We show how to embed classical logic in intuitionistic logic. This
means we can run a theorem prover for intuitionistic logic to prove
classical theorems. Of course, theorem proving in classical logic
is easier than intuitionistic logic, so we would not expect this to
yield a reasonably efficient prover for classical logic.

### Reading

*None yet*
### Key Concepts

- Logical embeddings
- Kolmogorov's translation
- Gödel's translation

### Links

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

Frank Pfenning
fp@cs