Polyadic and cylindric algebras of sentences

In this note we give an interpretation of cylindric algebras as algebras of sentences (rather than formulas) 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. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)