Nonfinitizability of classes of representable polyadic algebras

DOI10.2307/2270901MaRDI QIDQ5571689zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(18)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5571689)