Equational properties of iteration in algebraically complete categories

Z. Ésik, Anna Labella

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The main result is the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages336-347
Number of pages12
Volume1113
ISBN (Print)3540615504, 9783540615507
Publication statusPublished - 1996
Event21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996 - Cracow, Poland
Duration: Sep 2 1996Sep 6 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1113
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996
CountryPoland
CityCracow
Period9/2/969/6/96

Fingerprint

Fixed point
Acoustic waves
Iteration
Axiomatization
Axioms
Completeness
Theorem
Sound

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ésik, Z., & Labella, A. (1996). Equational properties of iteration in algebraically complete categories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1113, pp. 336-347). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1113). Springer Verlag.

Equational properties of iteration in algebraically complete categories. / Ésik, Z.; Labella, Anna.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1113 Springer Verlag, 1996. p. 336-347 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1113).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ésik, Z & Labella, A 1996, Equational properties of iteration in algebraically complete categories. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1113, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1113, Springer Verlag, pp. 336-347, 21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996, Cracow, Poland, 9/2/96.
Ésik Z, Labella A. Equational properties of iteration in algebraically complete categories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1113. Springer Verlag. 1996. p. 336-347. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ésik, Z. ; Labella, Anna. / Equational properties of iteration in algebraically complete categories. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1113 Springer Verlag, 1996. pp. 336-347 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b5836dabe4db45e3ad1e59ecbd9a955f,
title = "Equational properties of iteration in algebraically complete categories",
abstract = "The main result is the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.",
author = "Z. {\'E}sik and Anna Labella",
year = "1996",
language = "English",
isbn = "3540615504",
volume = "1113",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "336--347",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Equational properties of iteration in algebraically complete categories

AU - Ésik, Z.

AU - Labella, Anna

PY - 1996

Y1 - 1996

N2 - The main result is the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.

AB - The main result is the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.

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

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

M3 - Conference contribution

AN - SCOPUS:84947945247

SN - 3540615504

SN - 9783540615507

VL - 1113

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

SP - 336

EP - 347

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

PB - Springer Verlag

ER -