Results 291 to 300 of about 1,612,373 (342)

Linear Orders on General Algebras

Order, 2005
A characterization of partially ordered algebraic structures \((A,F,r)\) having a compatible linear extension of \(r\) is given. As a consequence, it is proved that a partial order \(r\) can be linearly extended if and only if it can be extended on every finitely generated subalgebra. A few further results are obtained.
Radeleczki, Sándor, Szigeti, Jenő
openaire   +1 more source

The algebraic theory of order

Applied Categorical Structures, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Ordered Algebras and Logic

, 2010
Ordered algebras such as Boolean algebras, Heyting algebras, lattice-ordered groups, and MV-algebras have long played a decisive role in logic, although perhaps only in recent years has the significance of the relationship between the two fields begun to
METCALFE GEORGE, PAOLI, FRANCESCO, TSINAKIS CONSTANTINE   +2 more
openaire   +3 more sources

C*-algebra generated by the paths semigroup

, 2016
In this paper we study the structure of the C*-algebra, generated by the representation of the paths semigroup on a partially ordered set (poset) and get the net of isomorphic C*-algebras over this poset. We construct the extensions of this algebra, such
S. Grigoryan, T. Grigoryan, E. Lipacheva, A. Sitdikov   +3 more
semanticscholar   +1 more source

Weakly ordered multiplicative basis of an algebra related to quiver theory [PDF]

Journal of Algebra, 2011
In this paper, for an algebra, a multiplicative basis with a weakly admissible order is introduced as an invariant under “almost” Morita equivalence.
Li, Fang, Zhu, Haiyan, Haiyan Zhu, Fang Li   +3 more
exaly   +2 more sources

Lattice Ordered Polynomial Algebras

Order, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Padmanabhan, R., Penner, P.
openaire   +2 more sources

Algebraic specifications of reachable higher-order algebras

1988
We propose a way of integrating predefined data type constructions, in particular higher-order function spaces, into the framework of algebraic specifications such that some standard results such as existence of initial and terminal algebras for hierarchical specifications are preserved.
Bernhard Möller, Andrzej Tarlecki, Martin Wirsing   +2 more
openaire   +2 more sources

Higher-order order-sorted algebras

1990
The aim of this paper is to present a new semantics of higher-order order-sorted types for functional programming, data type specification and program transformation. Our type discipline unifies higher-order functions, overloading and subtype polymorphism in a very simple way.
openaire   +1 more source

Partial algebra + order-sorted algebra = galactic algebra

2005
Galactic algebra is a clean superset of universal algebra, which suits this intention: to consider semi-functions (partial functions) and subsets of some universe, then to reason in a uniform way about identity (equality of terms), membership, and inclusion. The logic of galactic algebra is expressed as a first-order Hilbert-style system, which has all
openaire   +1 more source

Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups

, 2015
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable.
Murray Neuzerling
semanticscholar   +1 more source