Algorithmic aspects of intuitionistic propositional logic

Franzén, Torkel

Simple search

Advanced search

Statistics

Change search

Cite ExportLink to record

Permanent link

https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-22210

Direct link

http://ri.diva-portal.org/smash/record.jsf?pid=diva2:1041754

Cite

Citation style

apa
ieee
modern-language-association-8th-edition
vancouver
Other style

More styles

Language

de-DE
en-GB
en-US
fi-FI
nn-NO
nn-NB
sv-SE
Other locale

More languages

Output format

html
text
asciidoc
rtf

Algorithmic aspects of intuitionistic propositional logic

Franzén, Torkel

RISE - Research Institutes of Sweden, ICT, SICS.

1987 (English)Report (Other academic)

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. , p. 42

Series

SICS Research Report, ISSN 0283-3638 ; R87:10B

National Category

Computer and Information Sciences

Identifiers

URN: urn:nbn:se:ri:diva-22210OAI: oai:DiVA.org:ri-22210DiVA, id: diva2:1041754

Note

Original report number R87010B.

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-02-02Bibliographically approved

Open Access in DiVA

fulltext(3048 kB)

132 downloads

File information

File name FULLTEXT01.pdfFile size 3048 kBChecksum SHA-512

fb3e8f383752126d7136109a2b4bd17a1132d9d1e31a1413878c953f323bc7678801ec8a09ec8d56d9f3c1bcae041486357d0bb39fea872ff8a4c9e545b35cde

Type fulltextMimetype application/pdf

By organisation

SICS

On the subject