Existence and uniqueness of structures computable in polynomial time (Q321268): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10469-016-9377-6 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Complexity and categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countability of widths of algebraic reducibility structures for models in some classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic degree of unars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic dependences and reducibilities of constructivizations in universal domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraically nonequivalent constructivization for infinite-dimensional vector space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706487 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10469-016-9377-6 / rank
 
Normal rank

Latest revision as of 14:20, 9 December 2024

scientific article
Language Label Description Also known as
English
Existence and uniqueness of structures computable in polynomial time
scientific article

    Statements

    Identifiers