Robin Hirsch
Orcid: 0000-0002-2983-4178Affiliations:
- University College London, Department of Computer Science, UK
According to our database1,
Robin Hirsch
authored at least 53 papers
between 1994 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
First-order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier depth.
J. Symb. Log., 2022
Log. J. IGPL, 2022
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022
2021
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021
2020
CoRR, 2020
2019
Theor. Comput. Sci., 2019
2018
J. Symb. Log., 2018
The Temporal Logic of Two-Dimensional Minkowski Spacetime with Slower-Than-Light Accessibility Is Decidable.
Proceedings of the Advances in Modal Logic 12, 2018
Proceedings of the Relational and Algebraic Methods in Computer Science, 2018
2017
2016
There is no Finite-variable Equational Axiomatization of Representable Relation Algebras over Weakly Representable Relation Algebras.
Rev. Symb. Log., 2016
2015
2014
The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite Dimensions.
J. Symb. Log., 2014
2013
Corrigendum to: "Relation algebra reducts of cylindric algebras and complete representations".
J. Symb. Log., 2013
2012
2011
Rev. Symb. Log., 2011
J. Log. Algebraic Methods Program., 2011
2010
J. Log. Comput., 2010
2009
2008
Proceedings of the Sixth Workshop on Quantitative Aspects of Programming Languages, 2008
2007
J. Symb. Log., 2007
Proceedings of the Genetic and Evolutionary Computation Conference, 2007
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007
2005
The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable.
Log. J. IGPL, 2005
Appl. Artif. Intell., 2005
Proceedings of the Genetic Programming, 8th European Conference, 2005
2004
Artif. Intell., 2004
Proceedings of the Genetic Programming, 7th European Conference, 2004
2002
J. Symb. Log., 2002
2001
2000
1999
Log. J. IGPL, 1999
1998
Connections between cylindric algebras and relation algebras.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998
1997
The Finite Representable Relation Algebras are not Recursive (Abstract).
Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997
1996
1995
1994