Results 11 to 20 of about 25 (23)
Characterizing amalgmation bases for relation, cylindric and polyadic algebras
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras. We do the same for cylindric and polyadic algebras for all dimensions >1, infinite included.
openaire +2 more sources
A construction of cylindric and polyadic algebras from atomic relation algebras [PDF]
The purpose of this paper is to present a construction that does preserve and reflect representability in higher dimensions than 3. Given a simple atomic relation algebra \({\mathcal A}\) and a finite \(n\geq 3\), the author constructs effectively an atomic \(n\)-dimensional polyadic equality-type algebra \({\mathcal P}\) that for any signature \(L ...
exaly +2 more sources
Some of the next articles are maybe not open access.
The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable
Mathematical Logic Quarterly, 2006Tarek Sayed Ahmed
exaly
Epimorphisms in cylindric algebras and definability in finite variable logic
Algebra Universalis, 2009I Németi, Andreka H, Németi I
exaly
Varying interpolation and amalgamation in polyadic MV-algebras
Journal of Applied Non-Classical Logics, 2015Tarek Sayed Ahmed
exaly
Representations of polyadic-like equality algebras
Algebra Universalis, 2015Miklós Ferenczi, Ferenczi Miklós
exaly
Polyadic tense $$\theta$$ -valued $$\L$$ ukasiewicz–Moisil algebras
Soft Computing, 2011Carmen Chirita
exaly
Bare canonicity of representable cylindric and polyadic algebras
Annals of Pure and Applied Logic, 2013exaly
On nonrepresentable G-polyadic algebras with representable cylindric reducts
Logic Journal of the IGPL, 2011exaly

