On the definition and the representability of quasi‐polyadic equality algebras

Mathematical Logic Quarterly 62 (1-2):9-15 (2016)
  Copy   BIBTEX

Abstract

We show that the usual axiom system of quasi polyadic equality algebras is strongly redundant. Then, so called non‐commutative quasi‐polyadic equality algebras are introduced (), in which, among others, the commutativity of cylindrifications is dropped. As is known, quasi‐polyadic equality algebras are not representable in the classical sense, but we prove that algebras in are representable by quasi‐polyadic relativized set algebras, or more exactly by algebras in.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.201100109

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable.Tarek Ahmed - 2006 - Mathematical Logic Quarterly 52 (1):106-112.
The class of infinite dimensional neat reducts of quasi‐polyadic algebras is not axiomatizable.Tarek Sayed Ahmed - 2006 - Mathematical Logic Quarterly 52 (1):106-112.
Notions of density that imply representability in algebraic logic.Hajnal Andréka, Steven Givant, Szabolcs Mikulás, István Németi & András Simon - 1998 - Annals of Pure and Applied Logic 91 (2-3):93-190.
Finitary Polyadic Algebras from Cylindric Algebras.Miklós Ferenczi - 2007 - Studia Logica 87 (1):1-11.
Existence of partial transposition means representability in cylindric algebras.Miklös Ferenczi - 2011 - Mathematical Logic Quarterly 57 (1):87-94.
A Note on Neat Reducts.Tarek Sayed Ahmed - 2007 - Studia Logica 85 (2):139-151.
On the complexity of axiomatizations of the class of representable quasi‐polyadic equality algebras.Tarek Sayed Ahmed - 2011 - Mathematical Logic Quarterly 57 (4):384-394.
Bare canonicity of representable cylindric and polyadic algebras.Jannis Bulian & Ian Hodkinson - 2013 - Annals of Pure and Applied Logic 164 (9):884-906.
On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality.Tarek Sayed Ahmed - 2015 - Mathematical Logic Quarterly 61 (6):418-477.
A categorical approach to polyadic algebras.Roch Ouellet - 1982 - Studia Logica 41 (4):317 - 327.
On the equational theory of representable polyadic equality algebras.I. Nemeti - 1998 - Logic Journal of the IGPL 6 (1):3-15.
On the equational theory of representable polyadic equality algebras.István Németi & Gábor Sági - 2000 - Journal of Symbolic Logic 65 (3):1143-1167.
On the Equational Theory of Representable Polyadic Equality Algebras.Istvan Nemeti & Gabor Sagi - 2000 - Journal of Symbolic Logic 65 (3):1143-1167.
Relation algebras from cylindric and polyadic algebras.I. Nemeti & A. Simon - 1997 - Logic Journal of the IGPL 5 (4):575-588.
Conservative extension of polyadic MV-algebras to polyadic pavelka algebras.Dumitru Daniel Drăgulici - 2006 - Archive for Mathematical Logic 45 (5):601-613.

Analytics

Added to PP
2018-08-08

Downloads
12 (#1,089,546)

6 months
5 (#647,370)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the algebraization of Henkin‐type second‐order logic.Miklós Ferenczi - 2022 - Mathematical Logic Quarterly 68 (2):149-158.

Add more citations

References found in this work

On Cylindric Algebras Satisfying Merry-go-round Properties.Miklós Ferenczi - 2007 - Logic Journal of the IGPL 15 (2):183-197.

View all 6 references / Add more references