Pages that link to "Item:Q2946572"
From MaRDI portal
The following pages link to On the proof complexity of deep inference (Q2946572):
Displaying 23 items.
- A cirquent calculus system with clustering and ranking (Q301368) (← links)
- Extension without cut (Q714731) (← links)
- On the length of medial-switch-mix derivations (Q1685911) (← links)
- On the logical philosophy of assertive graphs (Q2228440) (← links)
- Proof analysis of Peirce's alpha system of graphs (Q2363507) (← links)
- True Concurrency of Deep Inference Proofs (Q2820698) (← links)
- Complexity of Deep Inference via Atomic Flows (Q2904403) (← links)
- On the Power of Substitution in the Calculus of Structures (Q2946759) (← links)
- On the Proof Complexity of Cut-Free Bounded Deep Inference (Q3010365) (← links)
- A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae (Q3066096) (← links)
- From Deep Inference to Proof Nets via Cut Elimination (Q3094143) (← links)
- Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic (Q3179185) (← links)
- Contextual Natural Deduction (Q3455860) (← links)
- FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover (Q3460043) (← links)
- Proof Complexity of the Cut-free Calculus of Structures (Q3623221) (← links)
- A Subatomic Proof System for Decision Trees (Q5056373) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- Combinatorial flows and their normalisation (Q5111329) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- A Logical Basis for Quantum Evolution and Entanglement (Q5414959) (← links)
- Maude as a Platform for Designing and Implementing Deep Inference Systems (Q5415654) (← links)
- An Algorithmic Interpretation of a Deep Inference System (Q5505576) (← links)
- A propositional cirquent calculus for computability logic. (Q6661240) (← links)
