Computable categoricity for algebraic fields with splitting algorithms (Q5246987): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1032631
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Russell G. Miller / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.1205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic copies of countable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Recursively Inseparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie Der Numerierungen III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of categoricity of computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of Algebraic Fields and Subfields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability of models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categoricity properties for computable algebraic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computable Dimension of I-Trees of Infinite Height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable categoricity of trees of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective content of field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable dimension of trees of infinite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>d</i>-computable categoricity for algebraic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computably Categorical Fields via Fermat’s Last Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Algebra, General Theory and Theory of Computable Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively Categorical Linear Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive isomorphism types of recursive Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997666 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594570984 / rank
 
Normal rank

Latest revision as of 08:47, 30 July 2024

scientific article; zbMATH DE number 6429115
Language Label Description Also known as
English
Computable categoricity for algebraic fields with splitting algorithms
scientific article; zbMATH DE number 6429115

    Statements

    Computable categoricity for algebraic fields with splitting algorithms (English)
    0 references
    0 references
    0 references
    22 April 2015
    0 references
    computably presented algebraic fields
    0 references
    splitting algorithm
    0 references
    computable categoricity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references