The complexity of computable categoricity (Q471691): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2014.09.022 / rank
Normal rank
 
Property / author
 
Property / author: Daniel D. Turetsky / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aim.2014.09.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009042084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categoricity in hyperarithmetical degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic bounds on complexity and definability at limit levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Categoricity of Graphs with Finite Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for torsion-free abelian groups is analytic complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspaces of computable vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable categoricity versus relative computable categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompleteness along paths in progressions of theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability of models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability of models and Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerations in computable structure theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable dimension of ordered abelian groups / 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: CONSTRUCTIVE ALGEBRAS I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537372 / 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: Q3949039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsically Hyperarithmetical Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of categoricity in computable structures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2014.09.022 / rank
 
Normal rank

Latest revision as of 18:27, 9 December 2024

scientific article
Language Label Description Also known as
English
The complexity of computable categoricity
scientific article

    Statements

    The complexity of computable categoricity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2014
    0 references
    computable categoricity
    0 references

    Identifiers

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