The following pages link to Focussing and proof construction (Q1840461):
Displaying 23 items.
- Safe recursion revisited. I: Categorical semantics for lower complexity (Q386608) (← links)
- Imperative programs as proofs via game semantics (Q388203) (← links)
- An approach to innocent strategies as graphs (Q418201) (← links)
- A categorical semantics for polarized MALL (Q866570) (← links)
- A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
- On linear logic planning and concurrency (Q1041042) (← links)
- Multi-focused proofs with different polarity assignments (Q1744415) (← links)
- Modularity of proof-nets. Generating the type of a module. (Q1766921) (← links)
- MELL in the calculus of structures (Q1884903) (← links)
- From axioms to synthetic inference rules via focusing (Q2120974) (← links)
- Non decomposable connectives of linear logic (Q2326414) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- On the unity of duality (Q2482843) (← links)
- Non-commutative proof construction: a constraint-based approach (Q2503402) (← links)
- Rewritings for Polarized Multiplicative and Exponential Proof Structures (Q2870318) (← links)
- Structural Focalization (Q2946730) (← links)
- Strong and Weak Quantifiers in Focused NL$$_{\text {CL}}$$ (Q2964000) (← links)
- A Categorical Setting for Lower Complexity (Q3178259) (← links)
- Axiom Directed Focusing (Q3638252) (← links)
- On geometry of interaction for polarized linear logic (Q4961719) (← links)
- Connecting Sequent Calculi with Lorenzen-Style Dialogue Games (Q5024728) (← links)
- Syntactic Completeness of Proper Display Calculi (Q5056369) (← links)
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method (Q5191105) (← links)