Related papers: Problems on neat embeddings solved by rainbow cons…
We take a long magical tour in algebraic logic, starting from classical results on neat embeddings due to Henkin, Monk and Tarski, all the way to recent results in algebraic logic using so--called rainbow constructions invented by Hirsch…
Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…
We use Monk like algebras to give a new proof that the classes of strongly representable relation algebras and finite dimensional cylindric algebras of dimension >2 are not elementary. Our construction is based on relation algebras have…
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…
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…
In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…
We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…
The idea in the title is to blow up a finite structure, replacing each 'colour or atom' by infinitely many, using blurs to represent the resulting term algebra, but the blurs are not enough to blur the structure of the finite structure in…
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is…
In ``Monk Algebras and Ramsey Theory,'' \emph{J. Log. Algebr. Methods Program.} (2022), Kramer and Maddux prove various representability results in furtherance of the goal of finding the smallest weakly representable but not representable…
In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…
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 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…
We generalize the notion of Monk's schema in such a way to integrate finite dimensions. This allows us to lift a plathora of deep results proved for finite dimensions to the infinite dimensional case, like the solution to problem 2.12 in…
This note presents several results in graph theory inspired by the author's work in the proof theory of linear logic; these results are purely combinatorial and do not involve logic. We show that trails avoiding forbidden transitions,…
Using constructions of Hirsch and Hodkinson, we show that the class of strongly atom structures for various cylindric-like algebras is not elementary. This applies to diagonal free reducts and polyadic algebras with and without equality.…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
(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…
We deal with various splitting methods in algebraic logic. The word `splitting' refers to splitting some of the atoms in a given relation or cylindric algebra each into one or more subatoms obtaining a bigger algebra, where the number of…
We formulate and prove the generalizations of Friedman's free set and thin set theorems and of the rainbow Ramsey theorem to colorings of barriers. We analyze the strength of these theorems from the point of view of computability theory…