Weak Godel's incompleteness property for some decidable versions of first order logic

Abstract

The founding of the theory of cylindric algebras, by Alfred Tarski, was a conscious effort to create algebras out of first order predicate calculus. Let $n\in \omega$. The classes of non-commutative cylindric algebras ($NC{A}_n$) and weakened cylindric algebras ($WC{A}_n$) were shown, by István Németi, to be examples of decidable versions of first order logic with $n$ variables. In this article, we give new proofs for the decidability of the equational theories of these classes. We also give an answer to the open problem, posed by Németi in 1985, addressing the atomicity of the finitely generated free algebras of these classes. We prove that all the finitely generated free algebras of the varieties $NC{A}_n$ and $WC{A}_n$ are not atomic. In other words, we prove that the corresponding versions of first order logic have weak Gödel's incompleteness property.

References in corpus (1)

• Weak Godel's incompleteness property for some decidable versions of the calculus of relations

Cited by in corpus (1)

• Varieties generated by completions