Pages that link to "Item:Q1275625"
From MaRDI portal
The following pages link to Permutability of proofs in intuitionistic sequent calculi (Q1275625):
Displaying 17 items.
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps (Q429596) (← links)
- On harmony and permuting conversions (Q518743) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- A geometrical procedure for computing relaxation (Q1011756) (← links)
- Termination of permutative conversions in intuitionistic Gentzen calculi (Q1275632) (← links)
- Cut-elimination and a permutation-free sequent calculus for intuitionistic logic (Q1577341) (← links)
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic (Q1725847) (← links)
- Varieties of linear calculi (Q1868337) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications (Q2683029) (← links)
- Issues in the analysis of proof-search strategies in sequential presentations of logics (Q2848048) (← links)
- CONTRACTIONS OF NONCONTRACTIVE CONSEQUENCE RELATIONS (Q3195588) (← links)
- (Q3794165) (← links)
- A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (Q4506460) (← links)
- A proof-theoretic study of the correspondence of classical logic and modal logic (Q4650293) (← links)
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction (Q5458374) (← links)
- The permutability of rules in the classical inferential calculus (Q5813906) (← links)
