Algorithmic proof with diminishing resources part 1

D. M. Gabbay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


We present goal directed computation prcedures for classical, intuitionistic and linear implication. The procedure allows for using assumptions at most once. Completeness is proved and proof theoretic results such as interpolation are indicated.

Original languageEnglish
Title of host publicationComputer Science Logic - 4th Workshop, CSL 1990, Proceedings
EditorsWolfgang Schrnfeld, Hans Kleine Buning H.K., Egon Borger, Michael M. Richter
PublisherSpringer Verlag
Number of pages18
ISBN (Print)9783540544876
StatePublished - 1991
Externally publishedYes
Event4th Workshop on Computer Science Logic, CSL 1990 - Heidelberg, Germany
Duration: 5 Oct 1990 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume533 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th Workshop on Computer Science Logic, CSL 1990
Period5/10/90 → …

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.


Dive into the research topics of 'Algorithmic proof with diminishing resources part 1'. Together they form a unique fingerprint.

Cite this