We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
We introduce a deductive system Bal which models the logic of balance of opposing forces or of balance between conflicting evidence or influences. "Truth values" are int...
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
We explore the notion of a pseudo-free group, first introduced by Hohenberger [Hoh03], and provide an alternative stronger definition. We show that if Z∗ n is a pseudo-free abe...
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...