Pages that link to "Item:Q1577341"

The following pages link to Cut-elimination and a permutation-free sequent calculus for intuitionistic logic (Q1577341):

Displaying 34 items.

• Genetic programming \(+\) proof search \(=\) automatic improvement (Q682376) (← links)
• The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
• Cut-elimination and interpolation for \(\Omega\)-logic (Q1114684) (← links)
• Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
• Termination of permutative conversions in intuitionistic Gentzen calculi (Q1275632) (← links)
• Indexed systems of sequents and cut-elimination (Q1372944) (← links)
• A negationless interpretation of intuitionistic theories. I (Q1577359) (← links)
• Goal-oriented proof-search in natural deduction for intuitionistic propositional logic (Q1725847) (← links)
• Sequent calculus proof theory of intuitionistic apartness and order relations (Q1818431) (← links)
• Structural cut elimination. I: Intuitionistic and classical logic (Q1854335) (← links)
• Is cut-free logic fit for unrestricted abstraction? (Q2131274) (← links)
• A cut-free sequent calculus for defeasible erotetic inferences (Q2278843) (← links)
• Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut (Q3305560) (← links)
• Proof-Search in Natural Deduction Calculus for Classical Propositional Logic (Q3455774) (← links)
• Completeness and Cut-elimination in the Intuitionistic Theory of Types--Part 2 (Q3553922) (← links)
• A Cut-Free and Invariant-Free Sequent Calculus for PLTL (Q3608433) (← links)
• Lexicographic Path Induction (Q3637202) (← links)
• Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus (Q3638285) (← links)
• Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order (Q3792660) (← links)
• CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT (Q4295221) (← links)
• (Q4503949) (← links)
• A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (Q4506460) (← links)
• Two loop detection mechanisms: A comparison (Q4610326) (← links)
• Symmetric normalisation for intuitionistic logic (Q4635630) (← links)
• (Q4636039) (← links)
• Cut Elimination in a Class of Sequent Calculi for Pure Type Systems (Q4924532) (← links)
• A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications (Q4934883) (← links)
• 1999 Spring Meeting of the Association for Symbolic Logic (Q4946842) (← links)
• PRESERVATION OF STRUCTURAL PROPERTIES IN INTUITIONISTIC EXTENSIONS OF AN INFERENCE RELATION (Q4961867) (← links)
• Free Definite Description Theory – Sequent Calculi and Cut Elimination (Q5006839) (← links)
• (Q5283968) (← links)
• Elementary elimination of prenex cuts in disjunction-free intuitionistic logic (Q5351952) (← links)
• Typed Lambda Calculi and Applications (Q5704011) (← links)
• Partial proof terms in the study of idealized proof search (Q6648177) (← links)