Chapman, Peter, McKinna, James and Urban, Christian (2008) Mechanising a proof of Craig's Interpolation Theorem for intuitionistic logic in nominal isabelle In: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics, 31 July - 1 August, 2011, Birmingham, UK, July 28 - August 1, 2008.Full text not available from this repository.
Craig's Interpolation Theorem is an important meta- theoretical result for several logics. Here we describe a formalisation of the result for first-order intuitionistic logic without function symbols or equality, with the intention of giving insight into how other such results in proof theory might be mechanically verified, notable cut-admissibility. We use the package Nominal Isabelle, which easily deals with the binding issues in the quantifier cases of the proof.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Uncontrolled Keywords:||Formal mathematics; nominal Isabelle; automated reasoning; logic|
|Subjects:||G000 Computing and Mathematical Sciences > G100 Mathematics|
|DOI (a stable link to the resource):||10.1007/978-3-540-85110-3_5|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||09 Feb 2012 12:18|
|Last Modified:||02 Mar 2015 14:17|
Actions (login required)
Downloads per month over past year