The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Encompassment properties and automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: More problems in rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for reduction properties solving / 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: Concatenation as a basis for arithmetic / 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
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: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic confluence tests and completion methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430308 / rank
 
Normal rank

Latest revision as of 11:14, 5 June 2024

scientific article
Language Label Description Also known as
English
The undecidability of the first-order theories of one step rewriting in linear canonical systems
scientific article

    Statements