The class of neat reducts is not elementary

Logic Journal of the IGPL 9 (4):593-628 (2001)
  Copy   BIBTEX

Abstract

We solve a problem of Tarski, and his co-authors Andréka, Henkin, Monk, and Németi and confirm a conjecture of Németi. We show that for any pair of ordinals 1 < α < β, the class of α-dimensional neat reducts of β-dimensional cylindric algebras is not elementary. The construction we use when α is infinite also settles a conjecture of Tarski in the affirmative

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/9.4.593

Links

PhilArchive



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

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

A Modeltheoretic Solution to a Problem of Tarski.Tarek Sayed Ahmed - 2002 - Mathematical Logic Quarterly 48 (3):343-355.
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.
On neat reducts of algebras of logic.Tarek Sayed Ahmed & Istvan Németi - 2001 - Studia Logica 68 (2):229-262.
Neat embeddings as adjoint situations.Tarek Sayed-Ahmed - 2015 - Synthese 192 (7):1-37.
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.
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.
Polyadic and cylindric algebras of sentences.Mohamed Amer & Tarek Sayed Ahmed - 2006 - Mathematical Logic Quarterly 52 (5):444-449.
On Neat Reducts and Amalgamation.Tarek Sayed-Ahmed - 2007 - Logic Journal of the IGPL 15 (1):33-39.
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.
On neat embeddings of cylindric algebras.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (6):666-668.
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.
The class of neat reducts is not Boolean closed.Tarek Sayed Ahmed - 2008 - Bulletin of the Section of Logic 37 (1):51-61.
Relation algebras from cylindric and polyadic algebras.I. Nemeti & A. Simon - 1997 - Logic Journal of the IGPL 5 (4):575-588.
Relation algebra reducts of cylindric algebras and an application to proof theory.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Journal of Symbolic Logic 67 (1):197-213.
Relation Algebra Reducts of Cylindric Algebras and Complete Representations.Robin Hirsch - 2007 - Journal of Symbolic Logic 72 (2):673 - 703.

Analytics

Added to PP
2015-02-04

Downloads
9 (#1,257,023)

6 months
6 (#526,916)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
A Note on Neat Reducts.Tarek Sayed Ahmed - 2007 - Studia Logica 85 (2):139-151.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references