Decidable fragments of field theories (Q5202171): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Definability and decision problems in arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials over Algebraic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elementary theory of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability and Decidability of Arithmetical Universal-Existential Sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE UNDECIDABILITY OF PURE TRANSCENDENTAL EXTENSIONS OF REAL FIELDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588717 / rank
 
Normal rank

Latest revision as of 14:30, 21 June 2024

scientific article; zbMATH DE number 4193642
Language Label Description Also known as
English
Decidable fragments of field theories
scientific article; zbMATH DE number 4193642

    Statements

    Decidable fragments of field theories (English)
    0 references
    1990
    0 references
    \(\forall \exists \) sentences in the language of rings
    0 references
    algebraic number field
    0 references
    purely transcendental extension
    0 references
    field of characteristic zero
    0 references
    extension of the rationals
    0 references
    axiomatizable
    0 references

    Identifiers