Sciweavers

13 search results - page 1 / 3
» Free abelian lattice-ordered groups
Sort
View
BIRTHDAY
2006
Springer
14 years 2 months ago
Finitely Presented Abelian Lattice-Ordered Groups
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...
Andrew M. W. Glass, Françoise Point
AML
2004
89views more  AML 2004»
13 years 10 months ago
The logic of equilibrium and abelian lattice ordered groups
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...
Adriana Galli, Renato A. Lewin, Marta Sagastume
NDJFL
2010
13 years 5 months ago
Decidability and Computability of Certain Torsion-Free Abelian Groups
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...
TCC
2004
Springer
96views Cryptology» more  TCC 2004»
14 years 4 months ago
On the Notion of Pseudo-Free Groups
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...
Ronald L. Rivest
EUROCRYPT
2005
Springer
14 years 4 months ago
The RSA Group is Pseudo-Free
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...
Daniele Micciancio