3 citations · 6 across the 36 of their papers we have counts for
4 papers · 2 filters
Finite relation algebras and omitting types in modal fragments of first order logic
Tarek Sayed Ahmed
Let 2<n\leq l<m< ω. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments o…
Splitting methods in algebraic logic: Proving results on non-atom-canonicity, non-finite axiomatizability and non-first oder definability for cylindric and relation algebras
Tarek Sayed Ahmed
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…
A solution to the finitizability problem for quantifier logics with equality
Tarek Sayed Ahmed
We consider countable so-called rich subsemigroups of (ωω,\circ); each such semigroup gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a co…
Problems on neat embeddings solved by rainbow constructions and Monk algebras
Tarek Sayed Ahmed
This paper is a survey of recent results and methods in (Tarskian) algebraic logic. We focus on cylindric algebras. Fix 2<n<ω. Rainbow constructions are used to solve problems on c…