CRAIG INTERPOLATION
Depending on the type of logic being considered, the definition of 'Craig interpolation' varies.
It was first proved in 1957 for first-order logic by William Craig.
Propositional Craig interpolation can be defined as follows:
If
:
is a tautology and there exists a formula such that all propositional variables of occur in both and , and
:
and
:
are tautologies, then is called an ''interpolant'' for
:.
A simple example is that of as an interpolant for
:∧∨.
In propositional logic, the 'Craig interpolation lemma' says that whenever an implication
:
is a tautology, there exists an interpolant.
Craig interpolation can be proved with different tools:
★ model-theoretically, via Robinson's joint consistency theorem: in presence of compactness, negation and conjunction, Robinson's joint consistency theorem and Craig interpolation are equivalent.
★ proof-theoretically, via a Sequent calculus. If cut elimination is possible and as a result the subformula property holds, then Craig interpolation is provable via induction over the derivations.
★ algebraically, using amalgamation theorems for the variety of algebras representing the logic.
★ via translation to other logics enjoying Craig interpolation.
Craig interpolation has many applications, among them consistency proofs, model checking, proofs in modular specifications, modular ontologies.
★ Fundamentals of Mathematical Logic, Hinman, P., , , A K Peters, 2005, ISBN 1-568-81262-0
★ Interpolation and Definability: Modal and Intuitionistic Logics (Oxford Logic Guides), Dov M. Gabbay and Larisa Maksimova, , , Oxford science publications, Clarendon Press, 2006, ISBN 978-0198511748
★ Eva Hoogland, ''Definability and Interpolation. Model-theoretic investigations''. PdD thesis, Amsterdam 2001.
★ W. Craig, ''Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory'', The Journal of Symbolic Logic 22 (1957), no. 3, 269–285.
'
It was first proved in 1957 for first-order logic by William Craig.
Propositional Craig interpolation can be defined as follows:
If
:
is a tautology and there exists a formula such that all propositional variables of occur in both and , and
:
and
:
are tautologies, then is called an ''interpolant'' for
:.
A simple example is that of as an interpolant for
:∧∨.
In propositional logic, the 'Craig interpolation lemma' says that whenever an implication
:
is a tautology, there exists an interpolant.
| Contents |
| Proofs of Craig interpolation |
| Applications |
| References |
Proofs of Craig interpolation
Craig interpolation can be proved with different tools:
★ model-theoretically, via Robinson's joint consistency theorem: in presence of compactness, negation and conjunction, Robinson's joint consistency theorem and Craig interpolation are equivalent.
★ proof-theoretically, via a Sequent calculus. If cut elimination is possible and as a result the subformula property holds, then Craig interpolation is provable via induction over the derivations.
★ algebraically, using amalgamation theorems for the variety of algebras representing the logic.
★ via translation to other logics enjoying Craig interpolation.
Applications
Craig interpolation has many applications, among them consistency proofs, model checking, proofs in modular specifications, modular ontologies.
References
★ Fundamentals of Mathematical Logic, Hinman, P., , , A K Peters, 2005, ISBN 1-568-81262-0
★ Interpolation and Definability: Modal and Intuitionistic Logics (Oxford Logic Guides), Dov M. Gabbay and Larisa Maksimova, , , Oxford science publications, Clarendon Press, 2006, ISBN 978-0198511748
★ Eva Hoogland, ''Definability and Interpolation. Model-theoretic investigations''. PdD thesis, Amsterdam 2001.
★ W. Craig, ''Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory'', The Journal of Symbolic Logic 22 (1957), no. 3, 269–285.
'
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
ä¸å›½
Français
Deutsch
Ελληνική
हिनà¥à¤¦à¥€
Italiano
日本語
Português
РуÑÑкий
Español