Premium
On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality
Author(s) -
Sayed Ahmed Tarek
Publication year - 2015
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.201300064
Subject(s) - mathematics , commutative property , countable set , variety (cybernetics) , algebraic semantics , unary operation , universal algebra , discrete mathematics , cartesian product , pure mathematics , algebraic number , algebra over a field , mathematical analysis , statistics
We consider countable so‐called rich subsemigroups of( ω ω , ∘ ) ; each such semigroup T gives a variety CPEA T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T . It is shown that for any such T , A ∈ CPEA Tif and only if A is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality set algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEA T is canonical and atom‐canonical. Imposing an extra condition on T , we prove that atomic algebras in CPEA T are completely representable and that CPEA T has the super amalgamation property. If T is rich and finitely represented , it is shown that CPEA T is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented.