activity
20112025
most citedWell structured program equivalence is highly undecidable

17 citations · 18 across the 5 of their papers we have counts for

collaborators

5 papers

math.NT2025

On efficient approximation of quadratic irrationals, signed Chebyshev polynomials and Householder's method

Peter H. van der Kamp, Anthony Overmars, Marcel Jackson +1

We provide efficient algorithms to compute convergents of quadratic irrationals. We show that for square roots, in settings where Galois' refinement of Lagrange's theorem holds, ce…

math.GR2025★ 1 cited

The finite basis problem for additively idempotent semirings that relate to S_7

Zidong Gao, Marcel Jackson, Miaomiao Ren +1

The -element additively idempotent semiring is a nonnitely based algebra of the smallest possible order. In this paper we study the nite basis problem for some additively…

math.LO2024

Minimal signatures with undecidability of representability by binary relations

Robin Hirsch, Marcel Jackson, Jaš Šemrl

A semigroup of binary relations (under composition) on a set is \emph{complemented} if it is closed under the taking of complements within . We resolve a 1991 proble…

math.LO2022

Equationally defined classes of semigroups

Peter M. Higgins, Marcel Jackson

We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class of algebras which is closed under the taking of direct products a…

cs.LO2011★ 17 cited

Well structured program equivalence is highly undecidable

Robert Goldblatt, Marcel Jackson

We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show…