The following pages link to (Q3999386):
Displaying 17 items.
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Indexed systems of sequents and cut-elimination (Q1372944) (← links)
- A termination proof for epsilon substitution using partial derivations (Q1401363) (← links)
- Reduction of finite and infinite derivations (Q1577482) (← links)
- A note on Gentzen's ordinal assignment (Q1734262) (← links)
- Essential structure of proofs as a measure of complexity (Q2183713) (← links)
- Cut elimination for a simple formulation of epsilon calculus (Q2478554) (← links)
- A deep inference system for the modal logic S5 (Q2642520) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Three faces of natural deduction (Q4610312) (← links)
- Studying provability in implicational intuitionistic logic (Q4916206) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301) (← links)
- Prawitz, Proofs, and Meaning (Q5213604) (← links)
- Intuitionistic Existential Instantiation and Epsilon Symbol (Q5213612) (← links)
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)
