activity
20152021
most citedA corrected strategy for proving no finite variable axiomatisation exists for RRA

2 citations · 2 across the 1 of their papers we have counts for

collaborators

5 papers

math.LO20212 cited

A corrected strategy for proving no finite variable axiomatisation exists for RRA

Rob Egrot, Robin Hirsch

We show that if for all finite there is a pair of non-isomorphic finite digraphs satisfying some additional conditions, one of which is that they cannot be distinguished in a c…

cs.LO2021

Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition

Robin Hirsch, Jaš Šemrl

Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model th…

cs.LO2020

The algebra of non-deterministic programs: demonic operators, orders and axioms

Robin Hirsch, Szabolcs Mikulás, Tim Stokes

Demonic composition, demonic refinement and demonic union are alternatives to the usual "angelic" composition, angelic refinement (inclusion) and angelic (usual) union defined on b…

math.LO2018

The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable

Robin Hirsch, Brett McLean

We work primarily with the Kripke frame consisting of two-dimensional Minkowski spacetime with the irreflexive accessibility relation 'can reach with a slower-than-light signal'. W…

math.RA2015

Meet-completions and ordered domain algebras

Rob Egrot, Robin Hirsch

Using the well-known equivalence between meet-completions of posets and standard closure operators we show a general method for constructing meet-completions for isotone poset expa…