The course will give a basic introduction to deep inference, which is a design principle for
proof formalisms in which inference rules can be applied at any depth inside the proof. In …

The Spirit of Node Replication. Page 358 The Spirit of Node Replication Delia Kesner1 , 2, Loıc
Peyrot 1, and Daniel Ventura3 ⋆ 1 Université de Paris, CNRS, IRIF, Paris, France { kesner …

Deep inference could succinctly be described as an extreme form of linear logic [12]. It is a
methodology for designing proof formalisms that generalise Gentzen formalisms, ie the …

Je r\'abek showed that cuts in classical propositional logic proofs in deep inference can be
eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias …

We define and study a term calculus implementing higher-order node replication. It is used
to specify two different (weak) evaluation strategies: call-by-name and fully lazy call-by …

We present two proof systems for implication-only intuitionistic logic in the calculus of
structures. The first is a direct adaptation of the standard sequent calculus to the deep …

The lambda-calculus is a mathematical model of functional programming languages, with an
emphasis on function application. Variants of the calculus are of interest to model specific …

This brief survey contains an informal presentation of the commutative/noncommutative
linear logic BV in terms of a naif space-temporal model. BV improves on the ability of linear …

Deep inference is a logical formalism developed inside the framework of the calculus of
structures. It exhibits proofs with contexts, which avoids some syntactic bureaucracies [6] …

[65] Alessio Guglielmi (2002): Recipe. Available at http://cs. bath. ac. uk/ag/p/AG2. pdf.[66]
Alessio Guglielmi (2002): Subatomic Logic. Available at http://cs. bath. ac. uk/ag/p/AG8 …