Problems on neat embeddings solved by rainbow constructions and Monk algebras

2015/02/03 by Tarek Sayed Ahmed, Ahmed, Tarek Sayed
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #FOS: Mathematics #Geometric and Algebraic Topology #Logic (math.LO) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1502.07701

openalex publication_date 2015/02/03 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

This paper is a survey of recent results and methods in (Tarskian) algebraic logic. We focus on cylindric algebras. Fix 2

Related

• A brief history of algebraic logic from neat embeddings to rainbow\n constructions
• Cylindric quasi-implication algebras
• Geometrical representation theorems for cylindric-type algebras
• Splitting methods in algebraic logic: Proving results on non-atom-canonicity, non-finite axiomatizability and non-first oder definability for cylindric and relation algebras
• Cylindric algebras of De Morgan-valued logic