Related papers: A solution to the finitizability problem for quant…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
This paper proves that the equational theory of the class $RA_{\alpha}^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_{\alpha}^{cp}$, for finite $\alpha$. That is, substitutions of…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…
We answer an implicit question of Ian Hodkinson's. We show that atomic Pinters algebras may not be completely representable, however the class of completely representable Pinters algebras is elementary and finitely axiomatizable. We obtain…
In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…
For an ordinal $\alpha$, $\sf PEA_{\alpha}$ denotes the class of polyadic equality algebras of dimension $\alpha$. We show that for several classes of algebras that are reducts of $\PEA_{\omega}$ whose signature contains all substitutions…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
We show that there exists an atomic representable polyadic equality algebra of finite dimension n\geq 3, such that the cylindric reduct of its completion is not in SNr_n\CA_{n+4}, hence the result in the title. This solves an open problem…
Fix 2<n<\omega. Let L_n denote first order logic restricted to the first n variables. CA_n denotes the class of cylindric algebras of dimension n and for m>n, Nr_n\CA_m(\subseteq CA_n) denotes the class of n-neat reducts of CA_m's. The…
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
We investigate structures that can be represented by omega-automata, so called omega-automatic structures, and prove that relations defined over such structures in first-order logic expanded by the first-order quantifiers `there exist at…
We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
Algebras of relations form an algebraic framework for the study of logical systems, extending the correspondence between Boolean algebras and propositional logic. Tarski's representable cylindric algebras $RCA_{\alpha}$, and Halmos'…
We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…