EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 141 – 160 of 2109

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...

Algebra, každý začátek je lehký [Book]

Kästner, Herbert, Göthner, Peter (1986)

Algebra v Sovětském svazu

Vladimír Kořínek (1952)

Časopis pro pěstování matematiky

Algebraic and graph-theoretic properties of infinite $n$ -posets

Zoltán Ésik, Zoltán L. Németh (2005)

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

A $Σ$ -labeled $n$ -poset is an (at most) countable set, labeled in the set $Σ$ , equipped with $n$ partial orders. The collection of all $Σ$ -labeled $n$ -posets is naturally equipped with $n$ binary product operations and $n$ $ω$ -ary product operations. Moreover, the $ω$ -ary product operations give rise to $n$ $...$

Algebraic and graph-theoretic properties of infinite n-posets

Zoltán Ésik, Zoltán L. Németh (2010) RAIRO - Theoretical Informatics and Applications

A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and nω-ary product operations. Moreover, the ω-ary product operations give rise to nω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the binary and ω-ary product operations form the free algebra on Σ in a variety axiomatizable by an infinite collection...

Algebraic approach to locally finite trees with one end

Bohdan Zelinka (2003) Mathematica Bohemica

Let

T

be an infinite locally finite tree. We say that

T

has exactly one end, if in

T

any two one-way infinite paths have a common rest (infinite subpath). The paper describes the structure of such trees and tries to formalize it by algebraic means, namely by means of acyclic monounary algebras or tree semilattices. In these algebraic structures the homomorpisms and direct products are considered and investigated with the aim of showing, whether they give algebras with the required properties. At...

Algebraic categories whose projectives are explicitly free.

Menni, Matías (2009)

Theory and Applications of Categories [electronic only]

Algebraic duality of constant algebras

Ivan Chajda, Radomír Halaš, Alexander G. Pinus (1999)

Czechoslovak Mathematical Journal

Algebraic functions on p-rings

A. Iskander (1972)

Colloquium Mathematicae

Algebraic lattices are complete sublattices of the clone lattice over an infinite set

Michael Pinsker (2007)

Fundamenta Mathematicae

The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with $2^{| X |}$ compact elements. We show that every algebraic lattice with at most $2^{| X |}$ compact elements is a complete sublattice of Cl(X).