Complexity of equational theory of relational algebras with standard projection elements
From MaRDI portal
Publication:514569
Recommendations
- scientific article; zbMATH DE number 150219
- 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; zbMATH DE number 4217898
- scientific article; zbMATH DE number 54353
- 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
Cites work
- scientific article; zbMATH DE number 35403 (Why is no real title available?)
- scientific article; zbMATH DE number 67032 (Why is no real title available?)
- scientific article; zbMATH DE number 150219 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 3480582 (Why is no real title available?)
- scientific article; zbMATH DE number 475187 (Why is no real title available?)
- scientific article; zbMATH DE number 638619 (Why is no real title available?)
- scientific article; zbMATH DE number 1507190 (Why is no real title available?)
- scientific article; zbMATH DE number 1852925 (Why is no real title available?)
- scientific article; zbMATH DE number 859798 (Why is no real title available?)
- scientific article; zbMATH DE number 868084 (Why is no real title available?)
- scientific article; zbMATH DE number 868093 (Why is no real title available?)
- scientific article; zbMATH DE number 3266605 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A completeness theorem for higher order logics
- A new representation theory: representing cylindric-like algebras by relativized set algebras
- Algebraic Logic, Where Does it Stand Today?
- Algebraizable logics
- Algebraization of quantifier logics, an introductory overview
- Cylindric algebras. Part II
- Definability issues in universal logic
- Finitary Algebraic Logic
- Finite Axiomatizability using additional predicates
- Interpreting first-order theories into a logic of records
- Non-finite-axiomatizability results in algebraic logic
- On an algebra of sets of finite sequences
- On notions of representability for cylindric-polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality
- On the search for a finitizable algebraization of first order logic
- On varieties of cylindric algebras with applications to logic
- Reducing first-order logic to \(\mathsf{Df}_3\), free algebras
- Representability of pairing relation algebras depends on your ontology
- Weakly associative relation algebras with projections
- Weakly higher order cylindric algebras and finite axiomatization of the representables
Cited in
(7)- On computation complexity problems concerning relation algebras
- Weakly associative relation algebras with projections
- scientific article; zbMATH DE number 4217898 (Why is no real title available?)
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- scientific article; zbMATH DE number 150219 (Why is no real title available?)
- Computing minimal projection modules for \(\mathcal{ELH}^r\)-terminologies
- Relation algebras can tile
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)
