A Note on Neat Reducts

Studia Logica 85 (2):139-151 (2007)
  Copy   BIBTEX

Abstract

SC, CA, QA and QEA denote the class of Pinter’s substitution algebras, Tarski’s cylindric algebras, Halmos’ quasi-polyadic and quasi-polyadic equality algebras, respectively. Let . and . We show that the class of n dimensional neat reducts of algebras in K m is not elementary. This solves a problem in [2]. Also our result generalizes results proved in [1] and [2]

Categories

Keywords

Reprint years

DOI

10.1007/s11225-007-9034-0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

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

On Neat Reducts and Amalgamation.Tarek Sayed-Ahmed - 2007 - Logic Journal of the IGPL 15 (1):33-39.
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts.Judit Madarász & Tarek Ahmed - 2009 - Logic Journal of the IGPL 17 (4):429-483.
On neat embeddings of cylindric algebras.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (6):666-668.
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamation.Judit Madarász & Tarek Ahmed - 2009 - Logic Journal of the IGPL 17 (6):755-802.
On neat reducts of algebras of logic.Tarek Sayed Ahmed & Istvan Németi - 2001 - Studia Logica 68 (2):229-262.
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.
The class of neat reducts is not Boolean closed.Tarek Sayed Ahmed - 2008 - Bulletin of the Section of Logic 37 (1):51-61.
A Modeltheoretic Solution to a Problem of Tarski.Tarek Sayed Ahmed - 2002 - Mathematical Logic Quarterly 48 (3):343-355.
Polyadic and cylindric algebras of sentences.Mohamed Amer & Tarek Sayed Ahmed - 2006 - Mathematical Logic Quarterly 52 (5):444-449.
The class of neat reducts is not elementary.T. Sayed-Ahmed - 2001 - Logic Journal of the IGPL 9 (4):593-628.
Neat embeddings as adjoint situations.Tarek Sayed-Ahmed - 2015 - Synthese 192 (7):1-37.
On neat reducts of algebras of logic', presented in Logic Colloquium 1996, abstract appeared in the.H. Andréka, I. NÉmeti & T. Sayed Ahmed - 1997 - Bulletin of Symbolic Logic 3 (2):249.
Not all representable cylindric algebras are neat reducts.Hajnal Andréka & István Németi - 1979 - Bulletin of the Section of Logic 8 (3):145-147.
Amalgamation for reducts of polyadic equality algebras, a negative result.Tarek Sayed Ahmed - 2008 - Bulletin of the Section of Logic 37 (1):37-50.
Neat embeddings and amalgamation.Tarek Sayed Ahmed & Basim Samir - 2006 - Bulletin of the Section of Logic 35 (4):163-171.

Analytics

Added to PP
2009-01-28

Downloads
47 (#337,165)

6 months
16 (#154,895)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Provability with finitely many variables.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Bulletin of Symbolic Logic 8 (3):348-379.

View all 11 references / Add more references