Linear problems in valued fields (Q1582303): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Diophantine Problems Over Local Fields I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine problems over local fields. III: Decidable fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification of quantifier-free formulae over ordered fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for automatic theorem proving in real geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Linear Quantifier Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On definable subsets of <i>p</i>-adic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning over networks by symbolic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of linear problems in fields / rank
 
Normal rank

Latest revision as of 16:12, 30 May 2024

scientific article
Language Label Description Also known as
English
Linear problems in valued fields
scientific article

    Statements

    Linear problems in valued fields (English)
    0 references
    0 references
    6 February 2001
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    elimination sets
    0 references
    linear formulas
    0 references
    quantifier elimination procedures
    0 references
    complexity
    0 references
    valued fields
    0 references
    decision problems
    0 references
    substructure completeness
    0 references
    0 references