On Neat Reducts and Amalgamation

Logic Journal of the IGPL 15 (1):33-39 (2007)
  Copy   BIBTEX

Abstract

We present a property of neat reducts commuting with forming subalgebras as a definability condition

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

On neat embeddings of cylindric algebras.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (6):666-668.
A Modeltheoretic Solution to a Problem of Tarski.Tarek Sayed Ahmed - 2002 - Mathematical Logic Quarterly 48 (3):343-355.
The class of neat reducts is not elementary.T. Sayed-Ahmed - 2001 - Logic Journal of the IGPL 9 (4):593-628.
The class of neat reducts is not Boolean closed.Tarek Sayed Ahmed - 2008 - Bulletin of the Section of Logic 37 (1):51-61.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
Neat embeddings and amalgamation.Tarek Sayed Ahmed & Basim Samir - 2006 - Bulletin of the Section of Logic 35 (4):163-171.
Polyadic and cylindric algebras of sentences.Mohamed Amer & Tarek Sayed Ahmed - 2006 - Mathematical Logic Quarterly 52 (5):444-449.
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.

Analytics

Added to PP
2015-02-04

Downloads
16 (#906,655)

6 months
3 (#976,504)

Historical graph of downloads
How can I increase my downloads?