Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nikolay Bazhenov / rank
Normal rank
 
Property / author
 
Property / author: Luca San Mauro / rank
Normal rank
 
Property / author
 
Property / author: Nikolay Bazhenov / rank
 
Normal rank
Property / author
 
Property / author: Luca San Mauro / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Nondensity of Double Bubbles in the D.C.E. Degrees / 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: FOUNDATIONS OF ONLINE STRUCTURE THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online presentations of finitely generated structures / 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: 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: The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5155667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of computability theory / 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: Computably enumerable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-time relation reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Glimm-Effros Dichotomy for Borel Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel Equivalence Relations / 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: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONSTRUCTIVE ALGEBRAS I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and abstract subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure of punctual dimension two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating unbounded search in computable algebra / 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: Classical recursion theory. The theory of functions and sets of natural numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive recursive ordered fields and some applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:49, 31 July 2024

scientific article; zbMATH DE number 7641231
Language Label Description Also known as
English
Primitive recursive equivalence relations and their primitive recursive complexity
scientific article; zbMATH DE number 7641231

    Statements

    Primitive recursive equivalence relations and their primitive recursive complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2023
    0 references
    primitive recursive function
    0 references
    primitive recursive equivalence relation
    0 references
    lattice
    0 references
    0 references
    0 references

    Identifiers