Displaying 61 – 80 of 100

Showing per page

Accessible set functors are universal

Libor Barto (2019)

Commentationes Mathematicae Universitatis Carolinae

It is shown that every concretizable category can be fully embedded into the category of accessible set functors and natural transformations.

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2010)

RAIRO - Theoretical Informatics and Applications

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Adjointness between theories and strict theories

Hans-Jürgen Vogel (2003)

Discussiones Mathematicae - General Algebra and Applications

The categorical concept of a theory for algebras of a given type was foundet by Lawvere in 1963 (see [8]). Hoehnke extended this concept to partial heterogenous algebras in 1976 (see [5]). A partial theory is a dhts-category such that the object class forms a free algebra of type (2,0,0) freely generated by a nonempty set J in the variety determined by the identities ox ≈ o and xo ≈ o, where o and i are the elements selected by the 0-ary operation symbols. If the object class of a dhts-category...

Aggregation operators on partially ordered sets and their categorical foundations

Mustafa Demirci (2006)

Kybernetika

In spite of increasing studies and investigations in the field of aggregation operators, there are two fundamental problems remaining unsolved: aggregation of L -fuzzy set-theoretic notions and their justification. In order to solve these problems, we will formulate aggregation operators and their special types on partially ordered sets with universal bounds, and introduce their categories. Furthermore, we will show that there exists a strong connection between the category of aggregation operators...

Currently displaying 61 – 80 of 100