Pages that link to "Item:Q1204120"
From MaRDI portal
The following pages link to Bounds for cut elimination in intuitionistic propositional logic (Q1204120):
Displaying 14 items.
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas (Q1589838) (← links)
- The G4i analogue of a G3i sequent calculus (Q2106879) (← links)
- Uniform interpolation and the existence of sequent calculi (Q2326416) (← links)
- Cut elimination for the unified logic (Q2367410) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Invertible infinitary calculus without loop rules for restricted FTL (Q2577594) (← links)
- Admissibility of structural rules for contraction-free systems of intuitionistic logic (Q2710593) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications (Q3647294) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
- Effective longest and infinite reduction paths in untyped λ-calculi (Q5878916) (← links)
- Proof theory for Lax Logic (Q6612814) (← links)
