Complexity of equational theory of relational algebras with standard projection elements
DOI10.1007/S11229-015-0689-1zbMATH Open1357.03097OpenAlexW2160213265MaRDI QIDQ514569FDOQ514569
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
Recommendations
- scientific article
- On the Complexity of the Equational Theory of Relational Action Algebras
- On computation complexity problems concerning relation algebras
- Complexity of equations valid in algebras of relations. II: Finite axiomatizations
- scientific article
- scientific article
- Decision problems for equational theories of relation algebras
- scientific article; zbMATH DE number 638616
- scientific article; zbMATH DE number 762061
- On the complexity of deciding typability in the relational algebra
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Abstract algebraic logic (03G27)
Cites Work
- Cylindric algebras. Part II
- Finite Axiomatizability using additional predicates
- Title not available (Why is that?)
- Finitary Algebraic Logic
- Title not available (Why is that?)
- Algebraic Logic, Where Does it Stand Today?
- Algebraizable logics
- Title not available (Why is that?)
- Algebraization of quantifier logics, an introductory overview
- Weakly higher order cylindric algebras and finite axiomatization of the representables
- Title not available (Why is that?)
- On varieties of cylindric algebras with applications to logic
- Interpreting first-order theories into a logic of records
- Representability of pairing relation algebras depends on your ontology
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-finite-axiomatizability results in algebraic logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A completeness theorem for higher order logics
- On the search for a finitizable algebraization of first order logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On an algebra of sets of finite sequences
Cited In (7)
- On computation complexity problems concerning relation algebras
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Weakly associative relation algebras with projections
- Computing minimal projection modules for \(\mathcal{ELH}^r\)-terminologies
- Relation algebras can tile
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Complexity of equational theory of relational algebras with standard projection elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514569)
