Classifying word problems of finitely generated algebras via computable reducibility (Q6116397): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Survey on Universal Computably Enumerable Equivalence Relations / 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: INITIAL SEGMENTS OF THE DEGREES OF CEERS / 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: The word problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problems and ceers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The category of equivalence relations / 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: 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: Effective aspects of algorithmically random structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely presented expansions of computably enumerable semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degrees of hyperhyperimmune sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of members of \(\Pi_ 1^ 0\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability of linear orders over negative equivalences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quest for algorithmically random infinite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A journey to computably enumerable structures (tutorial lectures) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely presented expansions of groups, semigroups, and algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Pi^0_1\)-presentations of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmically finite groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two notes on subshifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Configuration and Word Problems of Given Degree of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596776 / rank
 
Normal rank

Latest revision as of 19:07, 1 August 2024

scientific article; zbMATH DE number 7713611
Language Label Description Also known as
English
Classifying word problems of finitely generated algebras via computable reducibility
scientific article; zbMATH DE number 7713611

    Statements

    Classifying word problems of finitely generated algebras via computable reducibility (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2023
    0 references
    word problems
    0 references
    finitely generated algebras
    0 references
    computably enumerable structures
    0 references
    computably enumerable equivalence relations
    0 references
    computable reducibility
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers