On the Equational Theory of Representable Polyadic Equality Algebras

نویسندگان

  • István Németi
  • Gábor Sági
چکیده

Among others we will see that the equational theory of ! dimensional rep-resentable polyadic equality algebras (RPEA ! 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is nite schema-axiomatizable (and hence the equational theory of this class is nite schema-axiomatizable, as well). We will also see that the complexity of the equational theory of RPEA ! is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildikk o Sain and Viktor Gyuris 10], the following methodological conclusions will be drawn: the negative properties of polyadic (equality) algebras can be removed by switching from what we call the \polyadic algebraic paradigm" to the \cylindric algebraic paradigm".

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Equational Theory of Representable Polyadic Equality

Among others we will see that the equational theory of ω dimensional representable polyadic equality algebras (RPEAω’s) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence the equational theory of this class is finite schemaaxi...

متن کامل

A Modal Logic for Quanti cationand

The aim of this paper is to study the n-variable fragment of rst order logic from a modal perspective. We deene a modal formalism called cylindric mirror modal logic, and show how it is a modal version of rst order logic with substitution. In this approach, we can deene a semantics for the language which is closely related to algebraic logic, as we nd Polyadic Equality Algebras as the modal or ...

متن کامل

Introductory Course on Relation Algebras, Finite-dimensional Cylindric Algebras, and Their Interconnections

These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections, delivered at the Conference on Alge-Relation algebras (RA's) are closely linked to cylindric algebras (CA's) and polyadic equality algebras (PEA's), and yet in certain ways they are quite diierent. The links and diierences allow for constructive interaction between these sub...

متن کامل

A non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct

We construct an infinite dimensional quasi-polyadic equality algebra A such that its cylindric reduct is representable, while A itself is not representable. 1 The most well known generic examples of algebraizations of first order logic are Tarski’s cylindric algebras (CA) and Halmos’ polyadic equality algebras (PEA). The theory of cylindric algebras is well developed in the treatise [10], [11],...

متن کامل

Non-computability of the Equational Theory of Polyadic Algebras

In [3] Daigneault and Monk proved that the class of (ω dimensional) representable polyadic algebras (RPAω for short) is axiomatizable by finitely many equationschemas. However, this result does not imply that the equational theory of RPAω would be recursively enumerable; one simple reason is that the language of RPAω contains a continuum of operation symbols. Here we prove the following. Roughl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1998