Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
: If a knowledge-base KB entails a statement
, we can prove
Gödel Completeness Theorem
: There exists a complete proof system for FOL
KB ⊨ Q ↔ KB ⊢ Q
Gödel proved that there exists a complete proof system for FOL.
Gödel did not come up with such a concrete proof system.
Robinson’s Completeness Theorem
: Resolution is such a concrete complete proof system for FOL
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License