Cargando…
Complexity of proofs and their transformations in axiomatic theories
The aim of this work is to develop the tool of logical deduction schemata and use it to establish upper and lower bounds on the complexity of proofs and their transformations in axiomatized theories. The main results are establishment of upper bounds on the elongation of deductions in cut eliminatio...
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
1993
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2713824 |