Linear problems in valued fields
type: Item
instance of: scholarly article
title: Linear problems in valued fields
zbMATH Open document ID: 0982.03018
author: Thomas Sturm
published in: Journal of Symbolic Computation
publication date: 2001-02-06T00:00:00Z
review text: Extending the Skolem sets introduced by Weispfenning in 1988, the author gives quantifier elimination procedures of comparatively moderate complexity for linear problems in various classes of valued fields. Some consequences concerning the complexity of the decision problems and substructure completeness w.r.t. linear formulas for the considered classes of valued fields are also obtained.
Mathematics Subject Classification ID: 03C10
Mathematics Subject Classification ID: 12L12
Mathematics Subject Classification ID: 03C60
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 12J10
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 1513059
zbMATH Keywords: elimination sets
zbMATH Keywords: linear formulas
zbMATH Keywords: quantifier elimination procedures
zbMATH Keywords: complexity
zbMATH Keywords: valued fields
zbMATH Keywords: decision problems
zbMATH Keywords: substructure completeness
reviewed by: Şerban A. Basarab
describes a project that uses: REDLOG
MaRDI profile type: Publication
OpenAlex ID: W2056162328
cites work: Diophantine Problems Over Local Fields I
cites work: Diophantine problems over local fields. III: Decidable fields
cites work: The complexity of logical theories
cites work: Simplification of quantifier-free formulae over ordered fields
cites work: Q4531675
cites work: A new approach for automatic theorem proving in real geometry
cites work: Q4247790
cites work: Q5181354
cites work: The computational complexity of logical theories
cites work: Applying Linear Quantifier Elimination
cites work: On definable subsets of p-adic fields
cites work: Reasoning over networks by symbolic methods
cites work: Q3838772
cites work: Q3708785
cites work: The complexity of linear problems in fields
DOI: 10.1006/JSCO.1999.0303
description: scientific article; zbMATH DE number 1513059