Undecidability of pseudo \(p\)-adically closed fields (Q2277025): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The elementary theory of free pseudo <i>p</i>-adically closed fields of finite corank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute Galois Groups of p-Adically Maximal PpC Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free pseudo \(p\)-adically closed fields of finite corank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of regularly closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility results for separated variables equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of pseudo real closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The absolute Galois group of a pseudo p-adically closed field. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3349006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility of polynomials in several variables. II / rank
 
Normal rank

Revision as of 15:53, 21 June 2024

scientific article
Language Label Description Also known as
English
Undecidability of pseudo \(p\)-adically closed fields
scientific article

    Statements

    Undecidability of pseudo \(p\)-adically closed fields (English)
    0 references
    0 references
    0 references
    1992
    0 references
    A field \(K\) is called pseudo \(p\)-adically closed (PpC) if every non-empty absolutely irreducible affine variety defined over \(K\) has a K-rational point, provided that it has a simple rational point in each \(p\)-adic closure of \(K\). It is proved that several first-order theories of PpC fields are undecidable. This applies in particular to the theory of all PpC fields that admit a p-adic valuation. This puts a bound to several known decidability results for PpC fields due to Grob, Künzi and the author.
    0 references
    0 references
    0 references
    0 references
    0 references
    pseudo p-adically closed
    0 references
    first-order theories
    0 references
    decidability
    0 references