Weak quantifier elimination for the full linear theory of the integers
type: Item
instance of: scholarly article
title: Weak quantifier elimination for the full linear theory of the integers
zbMATH Open document ID: 1154.68112
author: Aless Lasaruk
author: Thomas Sturm
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 03C10
zbMATH DE Number: 5324353
zbMATH Keywords: quantifier elimination
zbMATH Keywords: integer constraint solving
zbMATH Keywords: implementation
describes a project that uses: REDLOG
describes a project that uses: REDUCE
MaRDI profile type: Publication
full work available at URL: s00200-007-0053-x
OpenAlex ID: W2097821910
cites work: The complexity of logical theories
cites work: Q5674430
cites work: Hilbert's Tenth Problem is Unsolvable
cites work: Simplification of quantifier-free formulae over ordered fields
cites work: Q4247790
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: The computational complexity of logical theories
cites work: Q4082296
cites work: A Bound on Solutions of Linear Integer Equalities and Inequalities
cites work: Applying Linear Quantifier Elimination
cites work: Q5613949
cites work: Linear problems in valued fields
cites work: Conditions for the existence of solutions of the three-dimensional planar transportation problem
cites work: The complexity of linear problems in fields
cites work: The complexity of almost linear diophantine problems
cites work: Q4226937
cites work: Quantifier elimination for real algebra -- the quadratic case and beyond
cites work: Simulation and optimization by quantifier elimination
DOI: 10.1007/S00200-007-0053-X
description: scientific article; zbMATH DE number 5324353