|
The complexity of pure and impure proofs| old_uid | 8588 |
|---|
| title | The complexity of pure and impure proofs |
|---|
| start_date | 2010/04/19 |
|---|
| schedule | 17h30-19h30 |
|---|
| online | no |
|---|
| summary | It has often been claimed that pure proofs are less valuable than impure proofs because of the relative "difficulty" or "complexity" of pure versus impure proofs. Whatever advantages pure proof may have over impure proof would be countered by disadvantages if impure proof is systematically "easier" or "simpler" than pure proof. In order to evaluate this claim, it is helpful to identify precise measures of proof complexity for which the claim may be tested. In this talk we investigate such measures arising from recent work in proof theory. In particular, we firstly discuss work arising from the program of "reverse mathematics", and secondly a "topological" measure of proof complexity studied in recent work by Alessandra Carbone. In both cases we will evaluate the thesis that impure proof is systematically "easier" or "simpler" than pure proof. |
|---|
| responsibles | Pataut, Dubucs, Panza |
|---|
| |
|