Change search
ReferencesLink to record
Permanent link

Direct link
Logic programming and the intuitionistic sequent calculus
Number of Authors: 1
1988 (English)Report (Refereed)
Abstract [en]

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.
Series
SICS Research Report, ISSN 0283-3638 ; R88:02
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22207OAI: oai:DiVA.org:ri-22207DiVA: diva2:1041751
Note
Original report number R88002.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(2808 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 2808 kBChecksum SHA-512
56199cb066887c7c2bf163fcbff92b78599e68387a34e765ac66033ea1285557569729c60673631a81820be9e74b58612e525f49f5fcc1998b60a4faeef0e167
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link