Complete categorical equational deduction

Grigore Roşu

doi:10.1007/3-540-44802-0_37

Complete categorical equational deduction

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

Abstract

A categorical four-rule deduction system for equational logics is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost. In fact, our deduction system is also complete for conditional equations, a new result at the author’s knowledge.

Original language	English (US)
Title of host publication	Computer Science Logic
Subtitle of host publication	15th International Workshop, CSL 2001 and 10th Annual Conference of the EACSL, Proceedings
Editors	Laurent Fribourg
Publisher	Springer
Pages	528-538
Number of pages	11
ISBN (Print)	3540425543, 9783540425540
DOIs	https://doi.org/10.1007/3-540-44802-0_37
State	Published - 2001
Externally published	Yes
Event	15th International Workshop on Computer Science Logic, CSL 2001 and 10th Annual Conference of the European Association for Computer Science Logic, EACSL 2001 - Paris, France Duration: Sep 10 2001 → Sep 13 2001

Publication series

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

Other

Other	15th International Workshop on Computer Science Logic, CSL 2001 and 10th Annual Conference of the European Association for Computer Science Logic, EACSL 2001
Country/Territory	France
City	Paris
Period	9/10/01 → 9/13/01

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/3-540-44802-0_37

Library availability

Discover UIUC Full Text

Cite this

Roşu, G. (2001). Complete categorical equational deduction. In L. Fribourg (Ed.), Computer Science Logic: 15th International Workshop, CSL 2001 and 10th Annual Conference of the EACSL, Proceedings (pp. 528-538). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2142). Springer. https://doi.org/10.1007/3-540-44802-0_37

Complete categorical equational deduction. / Roşu, Grigore.
Computer Science Logic: 15th International Workshop, CSL 2001 and 10th Annual Conference of the EACSL, Proceedings. ed. / Laurent Fribourg. Springer, 2001. p. 528-538 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2142).

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

Roşu, G 2001, Complete categorical equational deduction. in L Fribourg (ed.), Computer Science Logic: 15th International Workshop, CSL 2001 and 10th Annual Conference of the EACSL, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2142, Springer, pp. 528-538, 15th International Workshop on Computer Science Logic, CSL 2001 and 10th Annual Conference of the European Association for Computer Science Logic, EACSL 2001, Paris, France, 9/10/01. https://doi.org/10.1007/3-540-44802-0_37

Roşu G. Complete categorical equational deduction. In Fribourg L, editor, Computer Science Logic: 15th International Workshop, CSL 2001 and 10th Annual Conference of the EACSL, Proceedings. Springer. 2001. p. 528-538. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44802-0_37

@inproceedings{864cc0361df64a259c0264c854dcc538,

title = "Complete categorical equational deduction",

abstract = "A categorical four-rule deduction system for equational logics is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost. In fact, our deduction system is also complete for conditional equations, a new result at the author{\textquoteright}s knowledge.",

author = "Grigore Ro{\c s}u",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 15th International Workshop on Computer Science Logic, CSL 2001 and 10th Annual Conference of the European Association for Computer Science Logic, EACSL 2001 ; Conference date: 10-09-2001 Through 13-09-2001",

year = "2001",

doi = "10.1007/3-540-44802-0_37",

language = "English (US)",

isbn = "3540425543",

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

publisher = "Springer",

pages = "528--538",

editor = "Laurent Fribourg",

booktitle = "Computer Science Logic",

address = "Germany",

}

TY - GEN

T1 - Complete categorical equational deduction

AU - Roşu, Grigore

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

PY - 2001

Y1 - 2001

N2 - A categorical four-rule deduction system for equational logics is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost. In fact, our deduction system is also complete for conditional equations, a new result at the author’s knowledge.

AB - A categorical four-rule deduction system for equational logics is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost. In fact, our deduction system is also complete for conditional equations, a new result at the author’s knowledge.

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

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

U2 - 10.1007/3-540-44802-0_37

DO - 10.1007/3-540-44802-0_37

M3 - Conference contribution

AN - SCOPUS:23044529467

SN - 3540425543

SN - 9783540425540

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

SP - 528

EP - 538

BT - Computer Science Logic

A2 - Fribourg, Laurent

PB - Springer

T2 - 15th International Workshop on Computer Science Logic, CSL 2001 and 10th Annual Conference of the European Association for Computer Science Logic, EACSL 2001

Y2 - 10 September 2001 through 13 September 2001

ER -

Complete categorical equational deduction

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this