Polyadic and cylindric algebras of sentences

Mathematical Logic Quarterly 52 (5):444-449 (2006)
  Copy   BIBTEX

Abstract

In this note we give an interpretation of cylindric algebras as algebras of sentences of first order logic. We show that the isomorphism types of such algebras of sentences coincide with the class of neat reducts of cylindric algebras. Also we show how this interpretation sheds light on some recent results. This is done by likening Henkin's Neat Embedding Theorem to his celebrated completeness proof

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

External links

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

Through your library

Analytics

Added to PP
2013-12-01

Downloads
38 (#584,724)

6 months
2 (#1,683,984)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

On representability of neatly embeddable cylindric algebras.Miklós Ferenczi - 2000 - Journal of Applied Non-Classical Logics 10 (3):303-315.
A Modeltheoretic Solution to a Problem of Tarski.Tarek Sayed Ahmed - 2002 - Mathematical Logic Quarterly 48 (3):343-355.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.

View all 10 references / Add more references