arXiv:1302.1368 Abstract | arXiv Analytics

arXiv:1302.1368 [math.LO]Abstract References Reviews Resources

On the finitizability problem in algebraic logic; recent results

Published 2013-02-06Version 1

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.

Categories: math.LO

Keywords: algebraic logic, finitizability problem, old concepts, neat embeddings, erdos graphs

Related articles: Most relevant | Search more

arXiv:1108.0573 [math.LO] (Published 2011-08-02)

Algebraic logic and logically-geometric types in varieties of algebras

Boris Plotkin, Elena Aladova, Eugene Plotkin

arXiv:1307.1016 [math.LO] (Published 2013-07-02)

On completions, neat embeddings and omittings types, yet again

Tarek Sayed Ahmed

arXiv:1401.1103 [math.LO] (Published 2014-01-02)

Dedekind completions, neat embeddings and omitting types

Tarek Sayed Ahmed