The complexity of countable categoricity in finite languages (Q3117785): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import recommendations run Q6534273
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1002/malq.201110035 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969902453 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.3792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GALOIS GROUPS OF FIRST ORDER THEORIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On many-sorted ω-categorical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A countably categorical theory which is not \(G\)-compact / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a Lascar strong type / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidable Ehrenfeucht theory with exactly two hyperarithmetic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/MALQ.201110035 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q3434485 / rank
 
Normal rank
Property / Recommended article: Q3434485 / qualifier
 
Similarity Score: 0.81794155
Amount0.81794155
Unit1
Property / Recommended article: Q3434485 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5295696 / rank
 
Normal rank
Property / Recommended article: Q5295696 / qualifier
 
Similarity Score: 0.81317556
Amount0.81317556
Unit1
Property / Recommended article: Q5295696 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The index set of uncountably categorical theories / rank
 
Normal rank
Property / Recommended article: The index set of uncountably categorical theories / qualifier
 
Similarity Score: 0.7923747
Amount0.7923747
Unit1
Property / Recommended article: The index set of uncountably categorical theories / qualifier
 
Property / Recommended article
 
Property / Recommended article: Computability and Definability / rank
 
Normal rank
Property / Recommended article: Computability and Definability / qualifier
 
Similarity Score: 0.7726619
Amount0.7726619
Unit1
Property / Recommended article: Computability and Definability / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3544794 / rank
 
Normal rank
Property / Recommended article: Q3544794 / qualifier
 
Similarity Score: 0.77136415
Amount0.77136415
Unit1
Property / Recommended article: Q3544794 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The complexity of computable categoricity / rank
 
Normal rank
Property / Recommended article: The complexity of computable categoricity / qualifier
 
Similarity Score: 0.7684694
Amount0.7684694
Unit1
Property / Recommended article: The complexity of computable categoricity / qualifier
 
Property / Recommended article
 
Property / Recommended article: The degrees of categorical theories with recursive models / rank
 
Normal rank
Property / Recommended article: The degrees of categorical theories with recursive models / qualifier
 
Similarity Score: 0.7555788
Amount0.7555788
Unit1
Property / Recommended article: The degrees of categorical theories with recursive models / qualifier
 
Property / Recommended article
 
Property / Recommended article: Index sets of computable structures / rank
 
Normal rank
Property / Recommended article: Index sets of computable structures / qualifier
 
Similarity Score: 0.7476243
Amount0.7476243
Unit1
Property / Recommended article: Index sets of computable structures / qualifier
 
Property / Recommended article
 
Property / Recommended article: Index Sets of Computable Structures with Decidable Theories / rank
 
Normal rank
Property / Recommended article: Index Sets of Computable Structures with Decidable Theories / qualifier
 
Similarity Score: 0.74591774
Amount0.74591774
Unit1
Property / Recommended article: Index Sets of Computable Structures with Decidable Theories / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2885248 / rank
 
Normal rank
Property / Recommended article: Q2885248 / qualifier
 
Similarity Score: 0.7428945
Amount0.7428945
Unit1
Property / Recommended article: Q2885248 / qualifier
 

Latest revision as of 20:20, 27 January 2025

scientific article
Language Label Description Also known as
English
The complexity of countable categoricity in finite languages
scientific article

    Statements

    The complexity of countable categoricity in finite languages (English)
    0 references
    29 February 2012
    0 references
    countable categoricity
    0 references
    index sets
    0 references
    Ehrenfeucht theories
    0 references

    Identifiers