The first-order theory of linear one-step rewriting is undecidable (Q1275021): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encompassment properties and automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More problems in rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in rewriting III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / 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: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of the first order theory of one-step right ground rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equality up-to constraints over finite trees, context unification, and one-step rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics-Based Translation Methods for Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic confluence tests and completion methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of unification in the theory of one-sided distributivity and a multiplicative unit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for undecidability proofs of first order theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first-order theory of one-step rewriting is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first-order theory of one step rewriting in linear noetherian systems is undecidable / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 28 May 2024

scientific article
Language Label Description Also known as
English
The first-order theory of linear one-step rewriting is undecidable
scientific article

    Statements

    The first-order theory of linear one-step rewriting is undecidable (English)
    0 references
    0 references
    12 January 1999
    0 references
    term-rewriting system
    0 references

    Identifiers