A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly pre-complete positive equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly precomplete computably enumerable equivalence relations / 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: Equivalence relations induced by extensional formulae: classification by means of a new fixed point property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying positive equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creative Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2851819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorie der Numerierungen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS / 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: Computably enumerable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs realised by r.e. equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibilities among equivalence relations induced by recursively enumerable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Positive Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Group-Theoretic Decision Problems and Their Classification. (AM-68) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively precomplete numerations and arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creative sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Uniformly Finitely Precomplete Positive Equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank

Latest revision as of 15:41, 13 July 2024

scientific article
Language Label Description Also known as
English
A Survey on Universal Computably Enumerable Equivalence Relations
scientific article

    Statements

    A Survey on Universal Computably Enumerable Equivalence Relations (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    0 references
    computably enumerable equivalence relation
    0 references
    computable reducibility on equivalence relations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references