Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing ground reducibility and inductively complete positions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs by induction in equational theories with constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic proofs by induction in theories without constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sufficient-completeness and related properties of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic confluence tests and completion methods / rank
 
Normal rank

Latest revision as of 09:31, 22 May 2024

scientific article
Language Label Description Also known as
English
Testing for the ground (co-)reducibility property in term-rewriting systems
scientific article

    Statements

    Testing for the ground (co-)reducibility property in term-rewriting systems (English)
    0 references
    0 references
    25 October 1993
    0 references
    ground-reducible
    0 references
    ground-co-reducible
    0 references
    mechanizing inductive proofs
    0 references
    Knuth-Bendix completion
    0 references
    arbitrary term-rewriting systems
    0 references

    Identifiers