Complete categorical equational deduction

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationComputer Science Logic
Subtitle of host publication15th International Workshop, CSL 2001 and 10th Annual Conference of the EACSL, Proceedings
EditorsLaurent Fribourg
PublisherSpringer
Pages528-538
Number of pages11
ISBN (Print)3540425543, 9783540425540
StatePublished - Jan 1 2001
Externally publishedYes
Event15th 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 2001Sep 13 2001

Publication series

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

Other

Other15th International Workshop on Computer Science Logic, CSL 2001 and 10th Annual Conference of the European Association for Computer Science Logic, EACSL 2001
Country/TerritoryFrance
CityParis
Period9/10/019/13/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Complete categorical equational deduction'. Together they form a unique fingerprint.

Cite this