Pages that link to "Item:Q3644753"
From MaRDI portal
The following pages link to Degrees of Undecidability in Term Rewriting (Q3644753):
Displaying 8 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- Regaining cut admissibility in deduction modulo using abstract completion (Q2266989) (← links)
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (Q3558344) (← links)
- Degrees of Undecidability in Term Rewriting (Q3644753) (← links)
- (Q5109511) (← links)
- Complexity of Fractran and Productivity (Q5191114) (← links)
- Behavioral Rewrite Systems and Behavioral Productivity (Q5403074) (← links)
