Computable embeddings and strongly minimal theories (Q5422316): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.2178/jsl/1191333854 / rank
Normal rank
 
Property / author
 
Property / author: J. S. Roy Chisholm / rank
 
Normal rank
Property / author
 
Property / author: Julia F. Knight / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128798017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification from a Computable Viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Categorical Theories with Computable Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments in the theory of Borel reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism relation on countable torsion free abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Borel reductibility theory for classes of countable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2178/JSL/1191333854 / rank
 
Normal rank

Latest revision as of 16:58, 30 December 2024

scientific article; zbMATH DE number 5201553
Language Label Description Also known as
English
Computable embeddings and strongly minimal theories
scientific article; zbMATH DE number 5201553

    Statements

    Computable embeddings and strongly minimal theories (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2007
    0 references
    strongly minimal theory
    0 references
    computable embedding
    0 references
    Turing computable embedding
    0 references
    reducibility
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references