Displaying 121 – 140 of 206

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.

Active sums I.

J. Alejandro Díaz-Barriga, Francisco González-Acuña, Francisco Marmolejo, Leopoldo Román (2004)

Revista Matemática Complutense

Given a generating family F of subgroups of a group G closed under conjugation and with partial order compatible with inclusion, a new group S can be constructed, taking into account the multiplication in the subgroups and their mutual actions given by conjugation. The group S is called the active sum of F, has G as a homomorph and is such that S/Z(S) ≅ G/Z(G) where Z denotes the center.The basic question we investigate in this paper is: when is the active sum S of the family F isomorphic to the...

Adjoint Semilattice and Minimal Brouwerian Extensions of a Hilbert Algebra

Jānis Cīrulis (2012)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Let A : = ( A , , 1 ) be a Hilbert algebra. The monoid of all unary operations on A generated by operations α p : x ( p x ) , which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of A . This semilattice is isomorphic to the semilattice of finitely generated filters of A , it is subtractive (i.e., dually implicative), and its ideal lattice is isomorphic to the filter lattice of A . Moreover, the order dual of the adjoint semilattice is a minimal Brouwerian extension of A , and the...

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

Affine spaces as models for regular identities

Jung R. Cho, Józef Dudek (2002)

Colloquium Mathematicae

In [7] and [8], two sets of regular identities without finite proper models were introduced. In this paper we show that deleting one identity from any of these sets, we obtain a set of regular identities whose models include all affine spaces over GF(p) for prime numbers p ≥ 5. Moreover, we prove that this set characterizes affine spaces over GF(5) in the sense that each proper model of these regular identities has at least 13 ternary term functions and the number 13 is attained if and only if the...

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

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

Currently displaying 121 – 140 of 206