The school is directed to everyone doing postgraduate work in Computer Science or Mathematics with an interest in the field of Formal Logic and its applications. A background in Discrete Mathematics will be helpful. The school lasts one week and comprises both lectures and thematic sessions. The lectures are in the tradition of summer schools and cover one topic, from basic material to more advanced issues. Each session has an organizer responsible for inviting speakers who will talk about their work.
Linear logic is presented through ludics , a novel interactive explanation of logic.
In a sequent derivation, a proof is arranged as a tree, where each rule is a link between its sequents. A proof-net is a graph where each occurrence of a formula is a node and each rule is a link between the occurrences of its principal formulas. In this way, a proof-net equates sequent derivations that differ because of useless permutations of rules. In other words, let a proof structure be a graph obtained by freely combining the links corresponding to LL rules. In the latter case, phase semantics plays a crucial role.