Pages that link to "Item:Q1577341"
From MaRDI portal
The following pages link to Cut-elimination and a permutation-free sequent calculus for intuitionistic logic (Q1577341):
Displaying 10 items.
- Genetic programming \(+\) proof search \(=\) automatic improvement (Q682376) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
- A negationless interpretation of intuitionistic theories. I (Q1577359) (← links)
- Goal-oriented proof-search in natural deduction for intuitionistic propositional logic (Q1725847) (← links)
- Proof-Search in Natural Deduction Calculus for Classical Propositional Logic (Q3455774) (← links)
- Lexicographic Path Induction (Q3637202) (← links)
- A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (Q4506460) (← links)
- Two loop detection mechanisms: A comparison (Q4610326) (← links)
- 1999 Spring Meeting of the Association for Symbolic Logic (Q4946842) (← links)
