Computing with Gödel’s completeness theorem
Authors: Hugo Herbelin and Danko Ilik
Paper Information
| Title: | Computing with Gödel’s completeness theorem |
| Authors: | Hugo Herbelin and Danko Ilik |
| Proceedings: | PSC 2014 Abstracts |
| Editors: | Peter Schuster, Dirk Pattinson and Ana Sokolova |
| Keywords: | Completeness theorem for classical logic, Computational content, Intuitionistic logic, Henkin's proof |
| Abstract: | ABSTRACT. We give a short computational proof derived from Henkin's proof of Gödel’s completeness theorem. |
| Pages: | 2 |
| Talk: | Jul 17 11:30 |
| Paper: |  |