Logic programming and the intuitionistic sequent calculus
Number of Authors: 1
1988 (English)Report (Refereed)
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.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1988, 1. , 28 p.
SICS Research Report, ISSN 0283-3638 ; R88:02
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22207OAI: oai:DiVA.org:ri-22207DiVA: diva2:1041751
Original report number R88002.2016-10-312016-10-31Bibliographically approved