It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (Q5096169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3327746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the unification and matching problem for canonical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in permutative equational theories is undecidable / rank
 
Normal rank

Latest revision as of 21:15, 29 July 2024

scientific article; zbMATH DE number 7571941
Language Label Description Also known as
English
It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
scientific article; zbMATH DE number 7571941

    Statements

    It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    Turing machine
    0 references
    critical pair
    0 references
    halting problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references