ﻻ يوجد ملخص باللغة العربية
In this paper, we give new proofs of the celebrated Andreka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can also be viewed as multi-modal logics. The proofs herein are combinatorial and we also use some techniques from game theory.
For any pair of ordinals $alpha<beta$, $sf CA_alpha$ denotes the class of cylindric algebras of dimension $alpha$, $sf RCA_{alpha}$ denote the class of representable $sf CA_alpha$s and $sf Nr_alpha CA_beta$ ($sf Ra CA_beta)$ denotes the class of $alp
Let $alpha$ be an arbritary ordinal, and $2<n<omega$. In cite{3} accepted for publication in Quaestiones Mathematicae, we studied using algebraic logic, interpolation, amalgamation using $alpha$ many variables for topological logic with $alpha$ many
Let $2<n<mleq omega$. Let $CA_n$ denote the class of cylindric algebras of dimension $n$ and $RCA_n$ denote the class of representable $CA_n$s. We say that $Ain RCA_n$ is representable up to $m$ if $CmAtA$ has an $m$-square representation. An $m$ squ
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The construction and
Potential algebras feature in the minimal model program and noncommutative resolution of singularities, and the important cases are when they are finite dimensional, or of linear growth. We develop techniques, involving Grobner basis theory and gener