BibTeX
@MISC{Carbone96thecraig,
author = {A. Carbone},
title = {The Craig Interpolation Theorem for Schematic Systems},
year = {1996}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The notion of Schematic System has been introduced by Parikh in the early seventies. It is a metamathematical notion describing the concept of deduction system and the operation of substitution of terms and formulas in it. We show a generalization of the Craig Interpolation Theorem for a natural class of schematic systems while we determine sufficient conditions for a schematic system to enjoy Interpolation.
Citations
| 115 | Ideas and results in proof theory - Prawitz - 1971 |
| 71 | reasoning. A new form of the Herbrand-Gentzen theorem - Craig - 1957 |
| 56 | Resource Logics: Proof-theoretical Investigations - Roorda - 1991 |
| 25 | The undecidability of k-provability - Buss - 1991 |
| 23 | Some results on the length of proofs - Parikh - 1973 |
| 16 | On the number of steps in proofs - Kraj'icek - 1989 |
| 14 | Algebra of Proofs - SZABO - 1978 |
| 10 | Systematic construction of natural deduction systems for many-valued logics - Baaz, Fermuller, et al. - 1993 |
| 10 | A unification-theoretic method for investigating the k-provability problem - Farmer - 1991 |
| 9 | Proof Theory. Studies in Logic 81 - Takeuti - 1987 |
| 4 | On logical flow graphs - Carbone - 1993 |
| 4 | Interpolants, Cut Elimination and Flow Graphs - Carbone - 1995 |
| 3 | A survey of proof theory II - Kreisel - 1971 |
