On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality

DOI10.1002/malq.201300064zbMath1368.03069OpenAlexW2160776691MaRDI QIDQ3460522

Tarek Sayed Ahmed

Publication date: 7 January 2016

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201300064

zbMATH Keywords

cylindric algebraspolyadic algebrasrelativised set algebrasrepresentation theory in algebraic logic, finitization problemsemigroup approach in algebraic logic

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15) Abstract algebraic logic (03G27)

Related Items (9)

Omitting Types in Fragments and Extensions of First Order Logic ⋮ On Complete Representations and Minimal Completions in Algebraic Logic, Both Positive and Negative Results ⋮ Omitting types algebraically and more about amalgamation for modal cylindric algebras ⋮ A brief history of Tarskian algebraic logic with new perspectives and innovations ⋮ Notions of representability for cylindric algebras: some algebras are more representable than others ⋮ Existence of certain finite relation algebras implies failure of omitting types for \(L_n\) ⋮ Complexity of equational theory of relational algebras with standard projection elements ⋮ Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic ⋮ Blow Up and Blur Constructions in Algebraic Logic

Cites Work

• Unnamed Item
• The class of completely representable polyadic algebras of infinite dimensions is elementary
• Cylindric-like algebras and algebraic logic
• Relation algebras by games
• Algebraization of quantifier logics, an introductory overview
• Atom structures of cylindric algebras and relation algebras
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• A construction of cylindric and polyadic algebras from atomic relation algebras
• On amalgamation of reducts of polyadic algebras
• THE NEAT EMBEDDING PROBLEM FOR ALGEBRAS OTHER THAN CYLINDRIC ALGEBRAS AND FOR INFINITE DIMENSIONS
• The polyadic generalization of the Boolean axiomatization of fields of sets
• The class of polyadic algebras has the super amalgamation property
• A Stone Type Representation Theorem for Algebras of Relations of Higher Rank
• Finitary Algebraic Logic
• Algebraizable logics
• Finite algebras of relations are representable on finite sets
• Finite schematizable algebraic logic
• Complete representations in algebraic logic
• On the search for a finitizable algebraization of first order logic
• Three interpolation theorems for typeless logics
• Relation algebra reducts of cylindric algebras and complete representations
• Omitting types for finite variable fragments and complete representations of algebras
• Algebraic Logic, Where Does it Stand Today?
• A complete first-order logic with infinitary predicates
• Representation theory for polyadic algebras

This page was built for publication: On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality