Pages that link to "Item:Q1275021"
From MaRDI portal
The following pages link to The first-order theory of linear one-step rewriting is undecidable (Q1275021):
Displaying 9 items.
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Analysis of rewriting-based systems as first-order theories (Q1671151) (← links)
- Decidable first-order theories of one-step rewriting in trace monoids (Q1764424) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- The Existential Fragment of the One-Step Parallel Rewriting Theory (Q3636820) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
- (Q5109511) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)