Algorithmic proof with diminishing resources part 1

D. M. Gabbay

doi:10.1007/3-540-54487-9_58

Algorithmic proof with diminishing resources part 1

D. M. Gabbay

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

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 language	English
Title of host publication	Computer Science Logic - 4th Workshop, CSL 1990, Proceedings
Editors	Wolfgang Schrnfeld, Hans Kleine Buning H.K., Egon Borger, Michael M. Richter
Publisher	Springer Verlag
Pages	156-173
Number of pages	18
ISBN (Print)	9783540544876
DOIs	https://doi.org/10.1007/3-540-54487-9_58
State	Published - 1991
Externally published	Yes
Event	4th Workshop on Computer Science Logic, CSL 1990 - Heidelberg, Germany Duration: 5 Oct 1990 → …

Publication series

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

Conference

Conference	4th Workshop on Computer Science Logic, CSL 1990
Country/Territory	Germany
City	Heidelberg
Period	5/10/90 → …

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Access to Document

10.1007/3-540-54487-9_58

Cite this

Gabbay, D. M. (1991). Algorithmic proof with diminishing resources part 1. In W. Schrnfeld, H. K. Buning H.K., E. Borger, & M. M. Richter (Eds.), Computer Science Logic - 4th Workshop, CSL 1990, Proceedings (pp. 156-173). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 533 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54487-9_58

Gabbay, D. M. / Algorithmic proof with diminishing resources part 1. Computer Science Logic - 4th Workshop, CSL 1990, Proceedings. editor / Wolfgang Schrnfeld ; Hans Kleine Buning H.K. ; Egon Borger ; Michael M. Richter. Springer Verlag, 1991. pp. 156-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{bbf9b447f05b4790967bbeb14902bfef,

title = "Algorithmic proof with diminishing resources part 1",

abstract = "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.",

author = "Gabbay, {D. M.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 4th Workshop on Computer Science Logic, CSL 1990 ; Conference date: 05-10-1990",

year = "1991",

doi = "10.1007/3-540-54487-9_58",

language = "אנגלית",

isbn = "9783540544876",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "156--173",

editor = "Wolfgang Schrnfeld and {Buning H.K.}, {Hans Kleine} and Egon Borger and Richter, {Michael M.}",

booktitle = "Computer Science Logic - 4th Workshop, CSL 1990, Proceedings",

address = "גרמניה",

}

Gabbay, DM 1991, Algorithmic proof with diminishing resources part 1. in W Schrnfeld, HK Buning H.K., E Borger & MM Richter (eds), Computer Science Logic - 4th Workshop, CSL 1990, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 533 LNCS, Springer Verlag, pp. 156-173, 4th Workshop on Computer Science Logic, CSL 1990, Heidelberg, Germany, 5/10/90. https://doi.org/10.1007/3-540-54487-9_58

Algorithmic proof with diminishing resources part 1. / Gabbay, D. M.
Computer Science Logic - 4th Workshop, CSL 1990, Proceedings. ed. / Wolfgang Schrnfeld; Hans Kleine Buning H.K.; Egon Borger; Michael M. Richter. Springer Verlag, 1991. p. 156-173 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 533 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algorithmic proof with diminishing resources part 1

AU - Gabbay, D. M.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958984113&partnerID=8YFLogxK

U2 - 10.1007/3-540-54487-9_58

DO - 10.1007/3-540-54487-9_58

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958984113

SN - 9783540544876

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 156

EP - 173

BT - Computer Science Logic - 4th Workshop, CSL 1990, Proceedings

A2 - Schrnfeld, Wolfgang

A2 - Buning H.K., Hans Kleine

A2 - Borger, Egon

A2 - Richter, Michael M.

PB - Springer Verlag

T2 - 4th Workshop on Computer Science Logic, CSL 1990

Y2 - 5 October 1990

ER -

Gabbay DM. Algorithmic proof with diminishing resources part 1. In Schrnfeld W, Buning H.K. HK, Borger E, Richter MM, editors, Computer Science Logic - 4th Workshop, CSL 1990, Proceedings. Springer Verlag. 1991. p. 156-173. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54487-9_58

Algorithmic proof with diminishing resources part 1

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this