Browse by UCL people
Group by: Type | Date
Number of items: 22.
Article
Alm, JF;
Hirsch, R;
Maddux, RD;
(2016)
There is no finite-variable equational axiomatization of representable relation algebras over weakly representable relation algebras.
The Review of Symbolic Logic
, 9
(3)
pp. 511-521.
10.1017/S1755020316000265.
|
 |
|
Egrot, R;
Hirsch, R;
(2022)
Seurat games on Stockmeyer graphs.
Journal of Graph Theory
, 99
(2)
pp. 278-311.
10.1002/jgt.22741.
|
|
Egrot, ROB;
Hirsch, ROBIN;
(2021)
FIRST-ORDER AXIOMATISATIONS of REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS of UNBOUNDED QUANTIFIER DEPTH.
Journal of Symbolic Logic
10.1017/jsl.2021.88.
(In press).
|
|
|
Egrot, R;
Hirsch, R;
(2012)
Completely representable lattices.
Algebra Universalis
, 67
(3)
205 - 217.
10.1007/s00012-012-0181-4.
|
 |
|
Hirsch, R;
Hodkinson, I;
(2001)
Representability is not decidable for finite relation algebras.
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
, 353
(4)
pp. 1403-1425.
10.1090/S0002-9947-99-02264-3.
|
|
|
Hirsch, R;
Šemrl, J;
(2021)
Finite representability of semigroups with demonic refinement.
Algebra universalis
, 82
(2)
, Article 28. 10.1007/s00012-021-00718-5.
|
|
|
Hirsch, R;
Stokes, T;
(2021)
Axioms for signatures with domain and demonic composition.
Algebra universalis
, 82
(2)
, Article 24. 10.1007/s00012-021-00719-4.
|
|
Hirsch, R;
Egrot, R;
(2013)
Meet-completions and representations of ordered domain algebras.
The Journal of Symbolic Logic
(In press).
|
|
|
Hirsch, R;
Hodkinson, I;
(2009)
Strongly representable atom structures of cylindric algebras.
The Journal of Symbolic Logic
, 74
(3)
811 - 828.
|
|
|
Hirsch, R;
Hodkinson, I;
(2002)
Strongly representable atom structures of relation algebras.
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
, 130
(6)
pp. 1819-1831.
10.1090/S0002-9939-01-06232-3.
|
|
|
Hirsch, R;
Jackson, M;
(2012)
Some Undecidable Problems on Representability as Binary Relations.
The Journal of Symbolic Logic
, 77
(4)
pp. 1211-1244.
|
|
|
Hirsch, R;
Jackson, M;
Kowalski, T;
(2019)
Algebraic foundations for qualitative calculi and networks.
Theoretical Computer Science
, 768
pp. 99-116.
10.1016/j.tcs.2019.02.033.
|
|
Hirsch, R;
Jackson, M;
Mikulas, S;
(2016)
The algebra of functions with antidomain and range.
Journal of Pure and Applied Algebra
, 220
(6)
pp. 2214-2239.
10.1016/j.jpaa.2015.11.003.
|
|
Hirsch, R;
McLean, B;
(2017)
Disjoint union partial algebras.
Logical Methods in Computer Science
, 13
(2)
pp. 1-31.
10.23638/LMCS-13(2:10)2017.
|
|
Hirsch, R;
Reynolds, M;
(2018)
The temporal logic of two dimensional Minkowski spacetime is decidable.
Journal of Symbolic Logic
, 83
(3)
pp. 829-867.
10.1017/jsl.2017.79.
|
|
Hirsch, R;
Sayed Ahmed, T;
(2014)
The neat embedding problem for algebras other than cylindric algebras and for infinite dimensions.
The Journal of Symbolic Logic
, 79
(1)
pp. 208-222.
10.1017/jsl.2013.20.
|
Book
|
Hirsch, Robin;
Hodkinson, Ian;
(2002)
Relation algebras by games.
[Book].
Studies in Logic and the Foundations of Mathematics: Vol.147.
North Holland [Elsevier]: Amsterdam, the Netherlands.
|
Book chapter
|
Hirsch, R;
Hodkinson, I;
(2012)
Completions and Complete Representability for Cylindric Algebras.
In: Andreka, H and Nemeti, I and Ferenczki, M, (eds.)
Cylindric-like algebras and Algebraic Logic.
(pp. 61-89).
Springer Verlag: Berlin/ Heidelberg, Germany.
|
|
Proceedings paper
|
Hirsch, R;
(2018)
Decidability of equational theories for subsignatures of relation algebra.
In:
Relational and Algebraic Methods in Computer Science. RAMiCS 2018. Lecture Notes in Computer Science, vol 11194.
(pp. pp. 87-96).
Springer: Cham.
|
|
Hirsch, R;
McLean, B;
(2022)
EXPTIME-hardness of higher-dimensional Minkowski spacetime.
In: Fernández-Duque, D and Palmigiano, A and Pinchinat, S, (eds.)
Advances in Modal Logic.
(pp. pp. 491-505).
College Publications: London, UK.
|
|
Hirsch, R;
Semrl, J;
(2021)
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition.
In:
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
IEEE: Rome, Italy.
|
|
|
Hirsch, R;
McLean, B;
(2018)
The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable.
In: Bezhanishvili, G and D'Agostino, G and Metcalfe, G and Studer, T, (eds.)
Advances in Modal Logic, Volume 12.
(pp. pp. 347-366).
AiML: Bern, Switzerland.
|
