On the finitizability problem in algebraic logic; recent results
classification
🧮 math.LO
keywords
algebraiclogicarticleconceptsculminatingembeddingserdosfinitizability
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.