Complexity of equational theory of relational algebras with standard projection elements

DOI10.1007/S11229-015-0689-1zbMath1357.03097OpenAlexW2160213265MaRDI QIDQ514569

Ildikó Sain, Szabolcs Mikulás, András Simon

Publication date: 9 March 2017

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://eprints.bbk.ac.uk/id/eprint/13400/1/mss-15.pdf

zbMATH Keywords

algebraic logicrecursion theoryfinitization problem in algebraic logictheoretical computer science

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Abstract algebraic logic (03G27)

Cites Work

• Weakly higher order cylindric algebras and finite axiomatization of the representables
• Cylindric algebras. Part II
• On varieties of cylindric algebras with applications to logic
• Algebraization of quantifier logics, an introductory overview
• Interpreting first-order theories into a logic of records
• Finite Axiomatizability using additional predicates
• On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality
• Weakly associative relation algebras with projections
• Finitary Algebraic Logic
• Algebraizable logics
• Non-finite-axiomatizability results in algebraic logic
• A completeness theorem for higher order logics
• On the search for a finitizable algebraization of first order logic
• Algebraic Logic, Where Does it Stand Today?
• On an algebra of sets of finite sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of equational theory of relational algebras with standard projection elements