Related papers: Reflexive combinatory algebras

We study a finite-dimensional algebra $\Lambda$ constructed from a Postnikov diagram $D$ in a disk, obtained from the dimer algebra of Baur-King-Marsh by factoring out the ideal generated by the boundary idempotent. Thus $\Lambda$ is…

In this paper, we first introduce associative-Yamaguti algebras as the associative analogue of Lie-Yamaguti algebras. Associative algebras, reductive associative algebras and associative triple systems of the first kind form subclasses of…

We formulate a systematic construction of commuting quantum traces for reflection algebras. This is achieved by introducing two sets of generalized reflection equations with associated consistent fusion procedures. Products of their…

Classically, any structure for a signature $\Sigma$ may be completed to a model of a desired regular theory $T$ by means of the chase construction or small object argument. Moreover, this exhibits $\mathrm{Mod}(T)$ as weakly reflective in…

Quadratic algebras related to the reflection equations are introduced. They are quantum group comodule algebras. The quantum group $F_q(GL(2))$ is taken as the example. The properties of the algebras (center, representations, realizations,…

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

In a general algebraic setting, we state some properties of commutators of reflexive admissible relations.

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

We give an introduction to the "stable algebra of matrices" as related to certain problems in symbolic dynamics. We consider this stable algebra (especially, shift equivalence and strong shift equivalence) for matrices over general rings as…

In this paper we introduce a new property for normed algebras. This property which we call it stability, plays a key role in the studying of the theory of almost multiplier maps. In this note we study some of the basic properties of this…

We define algebras of quasi-quaternion type, which are symmetric algebras of tame representation type whose stable module category has certain structure similar to that of the algebras of quaternion type introduced by Erdmann. We observe…

A lot of developments made during the last years show that Kac-Moody algebras play an important role in the algebraic structure of some supergravity theories. These algebras would generate infinite-dimensional symmetry groups. The possible…

A C*-algebra $A$ is C*-reflexive if any countably generated Hilbert C*-module $M$ over $A$ is C*-reflexive, i.e. the second dual module $M''$ coincides with $M$. We show that a commutative C*-algebra $A$ is C*-reflexive if and only if for…

We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…