Change search
ReferencesLink to record
Permanent link

Direct link
Algorithmic aspects of intuitionistic propositional logic
Number of Authors: 1
1987 (English)Report (Refereed)
Abstract [en]

An algorithm for deciding validity in the intuitionistic propositional calculus is presented, together with source code in Quintus Prolog and some test data. The algorithm is based on an analysis of the use of contraction in the intuitionistic propositional sequent calculus, and also includes the techniques of "or-locking", "implication gathering", and "irrelevance checking".

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1987, 1. , 42 p.
Series
SICS Research Report, ISSN 0283-3638 ; R87:10B
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22210OAI: oai:DiVA.org:ri-22210DiVA: diva2:1041754
Note
Original report number R87010B.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(3048 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 3048 kBChecksum SHA-512
fb3e8f383752126d7136109a2b4bd17a1132d9d1e31a1413878c953f323bc7678801ec8a09ec8d56d9f3c1bcae041486357d0bb39fea872ff8a4c9e545b35cde
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