All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Terminal Coalgebras and Free Iterative Theories

Result description

Every finitary endofunctor H of Set can be represented via a finitary signature Sigma and a collection of equations called "basic". We describe a terminal coalgebra for Has the terminal Sigma-coalgebra (of all E-trees) modulo the congruence of applying the basic equations potentially infinitely often. As an application we describe a free iterative theory on H (in the sense of Calvin Elgot) as the theory of all rational E-trees modulo the analogous congruence. This yields a number of new examples of iterative theories, e.g., the theory of all strongly extensional, rational, finitely branching trees, free on the finite power-set functor, or the theory of all binary, rational unordered trees, free on one commutative binary operation. (c) 2006 Elsevier Inc. All rights reserved.

Keywords

algebraFree Iterative Theories

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Terminal Coalgebras and Free Iterative Theories

  • Original language description

    Every finitary endofunctor H of Set can be represented via a finitary signature Sigma and a collection of equations called "basic". We describe a terminal coalgebra for Has the terminal Sigma-coalgebra (of all E-trees) modulo the congruence of applying the basic equations potentially infinitely often. As an application we describe a free iterative theory on H (in the sense of Calvin Elgot) as the theory of all rational E-trees modulo the analogous congruence. This yields a number of new examples of iterative theories, e.g., the theory of all strongly extensional, rational, finitely branching trees, free on the finite power-set functor, or the theory of all binary, rational unordered trees, free on one commutative binary operation. (c) 2006 Elsevier Inc. All rights reserved.

  • Czech name

  • Czech description

Classification

  • Type

    Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Others

  • Publication year

    2006

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Information and Computation

  • ISSN

    0890-5401

  • e-ISSN

  • Volume of the periodical

    204

  • Issue of the periodical within the volume

    7

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    34

  • Pages from-to

  • UT code for WoS article

    000238782700005

  • EID of the result in the Scopus database

Basic information

Result type

Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

Jx

CEP

BA - General mathematics

Year of implementation

2006