The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable

DOI10.1002/MALQ.200510020zbMATH Open1090.03034OpenAlexW2072813375MaRDI QIDQ3376544FDOQ3376544

Authors: Tarek Sayed Ahmed 

Publication date: 24 March 2006

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200510020

Recommendations

• A note on neat reducts
• The class of neat reducts is not Boolean closed
• The class of 2-dimensional neat reducts is not elementary
• scientific article
• The class of neat reducts is not elementary

zbMATH Keywords

algebraic logicelementary classneat reductquasi-polyadic algebra

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15)

Cites Work

• A note on neat reducts
• Title not available (Why is that?)

Cited In (13)

• Quasi-polyadic algebras and their dual position
• On the definition and the representability of quasi-polyadic equality algebras
• On the representability of neatly embeddable CA's by cylindric relativized algebras
• Some results about neat reducts
• Title not available (Why is that?)
• New perspectives in algebraic logic, from neat embeddings to Erdős graphs
• Neat embeddings as adjoint situations
• On neat embeddings of algebraisations of first order logic
• Finitary polyadic algebras from cylindric algebras
• A non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct
• A note on neat reducts
• The class of 2-dimensional neat reducts is not elementary
• On neat reducts of reducts of cylindric algebras

This page was built for publication: The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376544)