Pages that link to "Item:Q1183598"
From MaRDI portal
The following pages link to Cut elimination and automatic proof procedures (Q1183598):
Displaying 12 items.
- On the elimination of quantifier-free cuts (Q650922) (← links)
- Cut formulas in propositional logic (Q689298) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- On the form of witness terms (Q982183) (← links)
- Depth of proofs, depth of cut-formulas and complexity of cut formulas (Q1329747) (← links)
- Weak logic theory (Q2276950) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Extracting Herbrand disjunctions by functional interpretation (Q2486989) (← links)
- The role of quantifier alternations in cut elimination (Q2565988) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- First order Büchi automata and their application to verification of LTL specifications (Q6643476) (← links)
