Évènement

Lutz Straßburger
LIX, INRIA Saclay
https://www.lix.polytechnique.fr/~lutz/

Date(s) : 01/04/2025   iCal
10h00 - 11h30

(Séminaire de l’équipe Lirica au LIS)

Combinatorial proofs, or “proofs without syntax”, form a graphical
semantics of proof in various logics that is canonical yet
complexity-aware: they are a polynomial-sized representation
of sequent proofs that factors out exactly the non-duplicating
permutations. This is achieved by factoring a proof into a purely linear
proof and a resource management part.

In the talk, I will introduce combinatorial proofs for classical logic and
intuitionistic logic. And if time permits, I will also discuss their
normalization.

Emplacement
Luminy - LIS, salle 04.02

Catégories

• Séminaire