Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Maddux, Roger D.
1989.
Canonical relativized cylindric set algebras.
Proceedings of the American Mathematical Society,
Vol. 107,
Issue. 2,
p.
465.
Maddux, Roger D.
1991.
The neat embedding problem and the number of variables required in proofs.
Proceedings of the American Mathematical Society,
Vol. 112,
Issue. 1,
p.
195.
Andr�ka, H.
1991.
Representations of distributive lattice-ordered semigroups with binary relations.
Algebra Universalis,
Vol. 28,
Issue. 1,
p.
12.
N�meti, Istv�n
1991.
Algebraization of quantifier logics, an introductory overview.
Studia Logica,
Vol. 50,
Issue. 3-4,
p.
485.
Brink, Chris
and
Schmidt, Renate A.
1992.
Subsumption computed algebraically.
Computers & Mathematics with Applications,
Vol. 23,
Issue. 2-5,
p.
329.
Andr�ka, H.
1994.
Weakly representable but not representable relation algebras.
Algebra Universalis,
Vol. 32,
Issue. 1,
p.
31.
Hirsch, Robin
1996.
Relation algebras of intervals.
Artificial Intelligence,
Vol. 83,
Issue. 2,
p.
267.
Andréka, Hajnal
1997.
Complexity of equations valid in algebras of relations part I: Strong non-finitizability.
Annals of Pure and Applied Logic,
Vol. 89,
Issue. 2-3,
p.
149.
Hirsch, Robin
and
Hodkinson, Ian
2001.
Relation algebras from cylindric algebras, I.
Annals of Pure and Applied Logic,
Vol. 112,
Issue. 2-3,
p.
225.
Gordeev, L.
2001.
Finite methods in 1-order formalisms.
Annals of Pure and Applied Logic,
Vol. 113,
Issue. 1-3,
p.
121.
Hirsch, Robin
and
Hodkinson, Ian
2001.
Strongly representable atom structures of relation algebras.
Proceedings of the American Mathematical Society,
Vol. 130,
Issue. 6,
p.
1819.
Andréka, H.
Németi, I.
and
Sain, I.
2001.
Handbook of Philosophical Logic.
p.
133.
Gordeev, Lev
2001.
Relational Methods for Computer Science Applications.
Vol. 65,
Issue. ,
p.
219.
Hirsch, Robin
and
Hodkinson, Ian
2001.
Relation algebras from cylindric algebras, II.
Annals of Pure and Applied Logic,
Vol. 112,
Issue. 2-3,
p.
267.
de Freitas, R.P.
and
Viana, J.P.
2002.
A Completeness Result for Relation Algebra with Binders.
Electronic Notes in Theoretical Computer Science,
Vol. 67,
Issue. ,
p.
204.
Hirsch, Robin
Hodkinson, Ian
and
Maddux, Roger D.
2002.
Provability with Finitely Many Variables.
Bulletin of Symbolic Logic,
Vol. 8,
Issue. 3,
p.
348.
2002.
Relation Algebras by Games.
Vol. 147,
Issue. ,
p.
629.
Ahmed, Tarek Sayed
2002.
A Modeltheoretic Solution to a Problem of Tarski.
MLQ,
Vol. 48,
Issue. 3,
p.
343.
Sayed Ahmed, Tarek
2003.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.
Notre Dame Journal of Formal Logic,
Vol. 44,
Issue. 3,
Jipsen, Peter
2004.
Relational and Kleene-Algebraic Methods in Computer Science.
Vol. 3051,
Issue. ,
p.
171.