Pages that link to "Item:Q5738964"
From MaRDI portal
The following pages link to Polynomial-time computation via local inference relations (Q5738964):
Displayed 8 items.
- Automatic decidability and combinability (Q549666) (← links)
- Analyzing innermost runtime complexity of term rewriting by dependency pairs (Q2351155) (← links)
- Modular proof systems for partial functions with Evans equality (Q2432764) (← links)
- On Interpolation and Symbol Elimination in Theory Extensions (Q2817926) (← links)
- Locality Results for Certain Extensions of Theories with Bridging Functions (Q5191097) (← links)
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (Q5200041) (← links)
- On Local Reasoning in Verification (Q5458332) (← links)
- On Hierarchical Reasoning in Combinations of Theories (Q5747749) (← links)