On the finitizability problem in algebraic logic; recent results

TL;DR

This survey explores the evolution of algebraic logic, highlighting key concepts like neat embeddings and the recent application of Erdos graphs to resolve fundamental problems.

Contribution

It provides a comprehensive overview of historical and modern developments in algebraic logic, emphasizing the role of Erdos graphs in recent breakthroughs.

Findings

Erdos graphs have been instrumental in solving key algebraic logic problems

The survey connects classical concepts with modern graph-theoretic approaches

Recent results have advanced understanding of the finitizability problem

Abstract

This is a survey article in algebraic logic, where we take a magical tour from old concepts due to Henkin, Monk and Tarski like neat embeddings, to modern views and perspectives, culminating in the use of Erdos graphs in settling important questions in algebraic logic.