Computable embeddability for algebraic structures (Q5876742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial computability of fields of algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Universal Computably Enumerable Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ceers computes true arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joins and meets in the structure of ceers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly precomplete computably enumerable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: FOUNDATIONS OF ONLINE STRUCTURE THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable bi-embeddable categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of bi-embeddable categoricity of equivalence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of bi-embeddable categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly precomplete equivalence relations in the Ershov hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying equivalence relations in the Ershov hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal equivalence relations in hyperarithmetical and analytical hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable isomorphisms of distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation provable equivalence and on partitions in effectively inseparable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying positive equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncountable structures are not classifiable up to bi-embeddability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-embeddability relation for countable abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of abelian groups / 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: PUNCTUAL CATEGORICITY AND UNIVERSALITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5155667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie der Numerierungen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism relations on computable structures / 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: Q3525843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computably enumerable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel Equivalence Relations / 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: COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures computable without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic hierarchy of Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete analytic equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLE ABELIAN GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating unbounded search in computable algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The back-and-forth method and computability without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure of punctual dimension two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree structure of equivalence relations under computable reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic complexity of algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: JSL volume 79 issue 2 Cover and Back matter / rank
 
Normal rank

Latest revision as of 10:12, 31 July 2024

scientific article; zbMATH DE number 7648876
Language Label Description Also known as
English
Computable embeddability for algebraic structures
scientific article; zbMATH DE number 7648876

    Statements

    Computable embeddability for algebraic structures (English)
    0 references
    2 February 2023
    0 references
    computable reducibility
    0 references
    preorder
    0 references
    computable structure theory
    0 references
    isomorphic embedding
    0 references
    torsion abelian group
    0 references
    distributive lattice
    0 references
    punctual structure
    0 references
    primitive recursion
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers