Nonfinitizability of classes of representable polyadic algebras

DOI10.2307/2270901zbMath0181.30003OpenAlexW2070636184MaRDI QIDQ5571689

James S. Johnson

Publication date: 1969

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

Full work available at URL: https://doi.org/10.2307/2270901

zbMATH Keywords

algebraic logic, model theory

Related Items (17)

On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras ⋮ Provability with Finitely Many Variables ⋮ On Satisfiability in ATL with Strategy Contexts ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Complexity of equations valid in algebras of relations. II: Finite axiomatizations ⋮ Bare canonicity of representable cylindric and polyadic algebras ⋮ On Complete Representations and Minimal Completions in Algebraic Logic, Both Positive and Negative Results ⋮ A construction of cylindric and polyadic algebras from atomic relation algebras ⋮ Non-finite-axiomatizability results in algebraic logic ⋮ Algebraization of quantifier logics, an introductory overview ⋮ The Neat Embedding Problem and the Number of Variables Required in Proofs ⋮ Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations ⋮ The relational model of data and cylindric algebras ⋮ Omitting types for algebraizable extensions of first order logic ⋮ Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic ⋮ Notions of density that imply representability in algebraic logic ⋮ Varieties of Algebras without the Amalgamation Property

This page was built for publication: Nonfinitizability of classes of representable polyadic algebras