Pages that link to "Item:Q5277766"

The following pages link to A system of interaction and structure (Q5277766):

Displaying 50 items.

• Realization for justification logics via nested sequents: modularity through embedding (Q435202) (← links)
• Deep inference and probabilistic coherence spaces (Q452333) (← links)
• A logical calculus for controlled monotonicity (Q472804) (← links)
• Extension without cut (Q714731) (← links)
• Cut elimination inside a deep inference system for classical predicate logic (Q817702) (← links)
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
• Syntactic cut-elimination for common knowledge (Q1024553) (← links)
• On linear logic planning and concurrency (Q1041042) (← links)
• On the decision problem for MELL (Q1733062) (← links)
• MELL in the calculus of structures (Q1884903) (← links)
• Composing dinatural transformations: towards a calculus of substitution (Q2031559) (← links)
• Prioritise the best variation (Q2117016) (← links)
• Hypersequent and display calculi -- a unified perspective (Q2259013) (← links)
• System BV is NP-complete (Q2478549) (← links)
• The three dimensions of proofs (Q2498912) (← links)
• On structuring proof search for first order linear logic (Q2503319) (← links)
• A deep inference system for the modal logic S5 (Q2642520) (← links)
• True Concurrency of Deep Inference Proofs (Q2820698) (← links)
• Canonical abstract syntax trees (Q2873780) (← links)
• Valentini's cut-elimination for provability logic resolved (Q2890695) (← 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)
• Linear Lambda Calculus and Deep Inference (Q3007666) (← links)
• Behavioural Analysis of Sessions Using the Calculus of Structures (Q3179170) (← links)
• Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (Q3637204) (← links)
• Deep Inference in Bi-intuitionistic Logic (Q3638293) (← links)
• (Q4558785) (← links)
• When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
• System NEL is Undecidable (Q4924537) (← links)
• Syntactic Cut-elimination for Common Knowledge (Q4982123) (← links)
• From Schütte’s Formal Systems to Modern Automated Deduction (Q5013905) (← links)
• Pomset Logic (Q5014600) (← links)
• A Subatomic Proof System for Decision Trees (Q5056373) (← links)
• An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
• (Q5089025) (← links)
• (Q5089276) (← links)
• An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
• Deep inference and expansion trees for second-order multiplicative linear logic (Q5236548) (← links)
• Constructing weak simulations from linear implications for processes with private names (Q5236556) (← links)
• Power and Limits of Structural Display Rules (Q5277918) (← links)
• A Logical Basis for Quantum Evolution and Entanglement (Q5414959) (← links)
• Maude as a Platform for Designing and Implementing Deep Inference Systems (Q5415654) (← links)
• Complexity of super-coherence problems in ASP (Q5418947) (← links)
• A deep inference system with a self-dual binder which is complete for linear lambda calculus (Q5739978) (← links)
• Scalable fine-grained proofs for formula processing (Q5919479) (← links)
• A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
• Enumerating Independent Linear Inferences (Q6135760) (← links)
• A System of Interaction and Structure III: The Complexity of BV and Pomset Logic (Q6137849) (← links)
• On the Pre- and Promonoidal Structure of Spacetime (Q6150163) (← links)