Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts

Logic Journal of the IGPL 17 (4):429-483 (2009)
  Copy   BIBTEX

Abstract

Introduced by Leon Henkin back in the fifties, the notion of neat reducts is an old venerable notion in algebraic logic. But it is often the case that an unexpected viewpoint yields new insights. Indeed, the repercussions of the fact that the class of neat reducts is not closed under forming subalgebras turn out to be enormous. In this paper we review and, in the process, discuss, some of these repercussions in connection with the algebraic notion of amalgamation. Some new unpublished results concerning neat reducts and amalgamation are given. . Several counterexamples which convey the gist of techniques used in this area are presented two of which are new . It is known that the algebraic notion of amalgamation in a class of algebras corresponds to the metalogical notion of interpolation in the corresponding logic. Answers to open question in the recent paper [54] concerning both amalgamation and interpolation are summarized in tabular form at the end of this paper. This paper appears in two parts. The present first part contains results on neat reducts. The second part contains results relating the notion of neat embeddings to various amalgamation properties.1

Links

PhilArchive



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

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 Reducts and Amalgamation.Tarek Sayed-Ahmed - 2007 - Logic Journal of the IGPL 15 (1):33-39.
On neat embeddings of cylindric algebras.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (6):666-668.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
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.
Polyadic and cylindric algebras of sentences.Mohamed Amer & Tarek Sayed Ahmed - 2006 - Mathematical Logic Quarterly 52 (5):444-449.
Relation algebras from cylindric and polyadic algebras.I. Nemeti & A. Simon - 1997 - Logic Journal of the IGPL 5 (4):575-588.
The class of neat reducts is not Boolean closed.Tarek Sayed Ahmed - 2008 - Bulletin of the Section of Logic 37 (1):51-61.
Amalgamation Theorems in Algebraic Logic, an overview.Tarek Sayed-Ahmed - 2005 - Logic Journal of the IGPL 13 (3):277-286.
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
15 (#939,247)

6 months
8 (#350,331)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Cylindric modal logic.Yde Venema - 1995 - Journal of Symbolic Logic 60 (2):591-623.

View all 30 references / Add more references