Linear problems in valued fields

DOI10.1006/jsco.1999.0303zbMath0982.03018OpenAlexW2056162328MaRDI QIDQ1582303

Thomas Sturm

Publication date: 6 February 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6a89c418316491806a83b3d539dcbee04367366c

zbMATH Keywords

complexitydecision problemsvalued fieldslinear formulaselimination setsquantifier elimination proceduressubstructure completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Model-theoretic algebra (03C60) Decidability of theories and sets of sentences (03B25) Model theory of fields (12L12) Quantifier elimination, model completeness, and related topics (03C10) Valued fields (12J10)

Related Items (3)

Better answers to real questions ⋮ Weak quantifier elimination for the full linear theory of the integers ⋮ Effective Quantifier Elimination for Presburger Arithmetic with Infinity

Uses Software

• REDLOG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of linear problems in fields
• The complexity of logical theories
• The computational complexity of logical theories
• A new approach for automatic theorem proving in real geometry
• Reasoning over networks by symbolic methods
• Simplification of quantifier-free formulae over ordered fields
• Diophantine problems over local fields. III: Decidable fields
• Applying Linear Quantifier Elimination
• On definable subsets of p-adic fields
• Diophantine Problems Over Local Fields I

This page was built for publication: Linear problems in valued fields