Finite schematizable algebraic logic

DOI10.1093/jigpal/5.5.699zbMath0886.03044OpenAlexW1970210230MaRDI QIDQ4357323

Viktor Gyuris, Ildikó Sain

Publication date: 25 September 1997

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/09232ebd47897ef57c55d54d070a4ac48c774292

zbMATH Keywords

representable cylindric algebrasnon-axiomatizabilityfinitary algebraization of first order logicfinite schemafinite schema axiomatizable classes of algebrasrepresentable quasi-polyadic algebras

Mathematics Subject Classification ID

Algebraic logic (03G99) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality, Complexity of equations valid in algebras of relations. I: Strong non-finitizability, A short proof of representability of fork algebras, How many varieties of cylindric algebras are there, Omitting types for finite variable fragments and complete representations of algebras, Neat embeddings, omitting types, and interpolation: an overview, Omitting types for algebraizable extensions of first order logic, Varieties of Algebras without the Amalgamation Property