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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.2178/jsl/1191333854 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.2178/JSL/1191333854 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Classification from a Computable Viewpoint / rank
 
Normal rank
Property / Recommended article: Classification from a Computable Viewpoint / qualifier
 
Similarity Score: 0.7313578
Amount0.7313578
Unit1
Property / Recommended article: Classification from a Computable Viewpoint / qualifier
 
Property / Recommended article
 
Property / Recommended article: Embeddings of computable structures / rank
 
Normal rank
Property / Recommended article: Embeddings of computable structures / qualifier
 
Similarity Score: 0.728258
Amount0.728258
Unit1
Property / Recommended article: Embeddings of computable structures / qualifier
 
Property / Recommended article
 
Property / Recommended article: On two problems of Turing complexity for strongly minimal theories / rank
 
Normal rank
Property / Recommended article: On two problems of Turing complexity for strongly minimal theories / qualifier
 
Similarity Score: 0.7271546
Amount0.7271546
Unit1
Property / Recommended article: On two problems of Turing complexity for strongly minimal theories / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5384986 / rank
 
Normal rank
Property / Recommended article: Q5384986 / qualifier
 
Similarity Score: 0.719574
Amount0.719574
Unit1
Property / Recommended article: Q5384986 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4934290 / rank
 
Normal rank
Property / Recommended article: Q4934290 / qualifier
 
Similarity Score: 0.717401
Amount0.717401
Unit1
Property / Recommended article: Q4934290 / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the computability-theoretic complexity of trivial, strongly minimal models / rank
 
Normal rank
Property / Recommended article: On the computability-theoretic complexity of trivial, strongly minimal models / qualifier
 
Similarity Score: 0.7149476
Amount0.7149476
Unit1
Property / Recommended article: On the computability-theoretic complexity of trivial, strongly minimal models / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4249356 / rank
 
Normal rank
Property / Recommended article: Q4249356 / qualifier
 
Similarity Score: 0.7137079
Amount0.7137079
Unit1
Property / Recommended article: Q4249356 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4523415 / rank
 
Normal rank
Property / Recommended article: Q4523415 / qualifier
 
Similarity Score: 0.70953333
Amount0.70953333
Unit1
Property / Recommended article: Q4523415 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Conditions of effective infinity for the set of computable indexings of a class of constructive models / rank
 
Normal rank
Property / Recommended article: Conditions of effective infinity for the set of computable indexings of a class of constructive models / qualifier
 
Similarity Score: 0.70486057
Amount0.70486057
Unit1
Property / Recommended article: Conditions of effective infinity for the set of computable indexings of a class of constructive models / qualifier
 
Property / Recommended article
 
Property / Recommended article: Metafinite model theory / rank
 
Normal rank
Property / Recommended article: Metafinite model theory / qualifier
 
Similarity Score: 0.70453566
Amount0.70453566
Unit1
Property / Recommended article: Metafinite model theory / qualifier
 

Latest revision as of 20:44, 27 January 2025

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