The complexity of the word problem for abelian l-groups

DOI10.1016/0304-3975(86)90089-7zbMath0633.03036OpenAlexW2039722546MaRDI QIDQ1095897

Volker Weispfenning

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90089-7

zbMATH Keywords

subdirect productuniversal theoryAbelian lattice- ordered groupAbelian linearly ordered groupsco-NP hardexistential sentences

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20)

Related Items

Proof theory for lattice-ordered groups ⋮ Fans, decision problems and generators of free abelian \(\ell\)-groups ⋮ The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete

Cites Work

• Unnamed Item
• Unnamed Item
• A simple proof of the hereditary undecidability of the theory of lattice- ordered Abelian groups
• Nonconstructivizability of the reduced part of a strongly constructive torsion-free Abelian group
• Komplexität von Entscheidungsproblemen. Ein Seminar
• Groupes et anneaux reticules
• A Bound on Solutions of Linear Integer Equalities and Inequalities