Franzén, Torkel (1988) Logic programming and the intuitionistic sequent calculus. [SICS Report]
The report contains some basic logical results and observations relevant to the use of intuitionistic logic as a programming language. In particular, a Kripke completeness proof is given for a formalization of intuitionistic logic incorporating quasi-free identity, and it is argued that full intuitionistic logic is too complicated to be useful, in spite of its superficial "constructive" aspects.
|Item Type:||SICS Report|
|Additional Information:||Original report number R88002.|
|Deposited By:||Vicki Carleson|
|Deposited On:||17 Sep 2009|
|Last Modified:||18 Nov 2009 16:10|
Repository Staff Only: item control page