Graphs realised by r.e. equivalence relations (Q2349100): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Initial segments of recursive linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rekursive Algebren mit Kettenbedingungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying the amount of verboseness / 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: Strong isomorphism reductions in complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite time decidable equivalence relation theory / 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: Q4934289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence Relations on Classes of Computable Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Σ<sup>1</sup> <sub>1</sub> equivalence relations over the natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effective theory of Borel equivalence relations / 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: Reducibilities among equivalence relations induced by recursively enumerable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theoretic properties of frequency computation and bounded queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Positive Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively precomplete numerations and arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank

Latest revision as of 06:24, 10 July 2024

scientific article
Language Label Description Also known as
English
Graphs realised by r.e. equivalence relations
scientific article

    Statements

    Graphs realised by r.e. equivalence relations (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2015
    0 references
    recursively enumerable equivalence relation
    0 references
    recursively enumerable structure
    0 references
    \(m\)-reducibility
    0 references
    \(C\)-reducibility
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references