Complexity of equational theory of relational algebras with standard projection elements
type: Item
instance of: scholarly article
title: Complexity of equational theory of relational algebras with standard projection elements
zbMATH Open document ID: 1357.03097
author: Szabolcs Mikulás
author: Ildikó Sain
author: András Simon
published in: Synthese
publication date: 2017-03-09T00:00:00Z
full work available at URL: mss-15.pdf
Mathematics Subject Classification ID: 03G27
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 6693208
zbMATH Keywords: algebraic logic
zbMATH Keywords: finitization problem in algebraic logic
zbMATH Keywords: recursion theory
zbMATH Keywords: theoretical computer science
MaRDI profile type: Publication
OpenAlex ID: W2160213265
cites work: Q3989924
cites work: Q2853707
cites work: Weakly higher order cylindric algebras and finite axiomatization of the representables
cites work: Q4789455
cites work: Q4873967
cites work: Non-finite-axiomatizability results in algebraic logic
cites work: Algebraizable logics
cites work: Q5551142
cites work: Finite Axiomatizability using additional predicates
cites work: Q2853712
cites work: Weakly associative relation algebras with projections
cites work: Q4503910
cites work: Q4063140
cites work: Cylindric algebras. Part II
cites work: Q4305492
cites work: Q4011720
cites work: Representability of pairing relation algebras depends on your ontology
cites work: Q4032851
cites work: Finitary Algebraic Logic
cites work: On an algebra of sets of finite sequences
cites work: On varieties of cylindric algebras with applications to logic
cites work: Algebraization of quantifier logics, an introductory overview
cites work: Q5573961
cites work: A completeness theorem for higher order logics
cites work: Q4873976
cites work: Q2853724
cites work: On the search for a finitizable algebraization of first order logic
cites work: Q4870570
cites work: Algebraic Logic, Where Does it Stand Today?
cites work: On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality
cites work: Q4273424
cites work: Q4040000
cites work: Interpreting first-order theories into a logic of records
DOI: 10.1007/S11229-015-0689-1
Recommended article: Q4032851
Recommended article: On the Complexity of the Equational Theory of Relational Action Algebras
Recommended article: On computation complexity problems concerning relation algebras
Recommended article: Complexity of equations valid in algebras of relations. II: Finite axiomatizations
Recommended article: Q3364101
Recommended article: Q4000536
Recommended article: Decision problems for equational theories of relation algebras
Recommended article: Q4305489
Recommended article: Q4835905
Recommended article: On the complexity of deciding typability in the relational algebra
description: scientific article; zbMATH DE number 6693208