The following pages link to Lutz Straßburger (Q714730):
Displaying 50 items.
- Extension without cut (Q714731) (← links)
- On the length of medial-switch-mix derivations (Q1685911) (← links)
- Proof theory for indexed nested sequents (Q1694451) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- Maehara-style modal nested calculi (Q1734264) (← links)
- From syntactic proofs to combinatorial proofs (Q1799109) (← links)
- MELL in the calculus of structures (Q1884903) (← links)
- Game semantics for constructive modal logic (Q2142094) (← links)
- On combinatorial proofs for modal logic (Q2180519) (← links)
- Towards a combinatorial proof theory (Q2180521) (← links)
- On combinatorial proofs for logics of relevance and entailment (Q2303577) (← links)
- Focused and Synthetic Nested Sequents (Q2811354) (← links)
- Herbrand-Confluence (Q2871477) (← links)
- (Q2915680) (← links)
- A system of interaction and structure IV (Q2946642) (← links)
- On the Power of Substitution in the Calculus of Structures (Q2946759) (← links)
- Non-crossing Tree Realizations of Ordered Degree Sequences (Q2964006) (← links)
- On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)
- A system of interaction and structure V: the exponentials and splitting (Q3008232) (← links)
- From Deep Inference to Proof Nets via Cut Elimination (Q3094143) (← links)
- On Nested Sequents for Constructive Modal Logics (Q3196338) (← links)
- A fully labelled proof system for intuitionistic modal logics (Q3382814) (← links)
- (Q3520842) (← links)
- What Is the Problem with Proof Nets for Classical Logic? (Q3576229) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (Q3637204) (← links)
- Expanding the Realm of Systematic Proof Theory (Q3644747) (← links)
- Modular Sequent Systems for Modal Logic (Q3648728) (← links)
- (Q4428303) (← links)
- (Q4428313) (← links)
- Symmetric normalisation for intuitionistic logic (Q4635630) (← links)
- (Q4636304) (← links)
- Herbrand-Confluence for Cut Elimination in Classical First Order Logic (Q4649555) (← links)
- (Q4783301) (← links)
- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics (Q4910421) (← links)
- System NEL is Undecidable (Q4924537) (← links)
- (Q5039162) (← links)
- MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description) (Q5049018) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- (Q5089024) (← links)
- (Q5111329) (← links)
- Logic Beyond Formulas (Q5145617) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- Deep inference and expansion trees for second-order multiplicative linear logic (Q5236548) (← links)
- No complete linear term rewriting system for propositional logic (Q5277875) (← links)
- From Proof Nets to the Free *-Autonomous Category (Q5310668) (← links)
- (Q5311060) (← links)
- Computer Science Logic (Q5311252) (← links)
- Modular Focused Proof Systems for Intuitionistic Modal Logics (Q5369481) (← links)
- A Logical Basis for Quantum Evolution and Entanglement (Q5414959) (← links)
