Incarnation in Ludics and maximal cliques of paths
Myriam Quatrini (IML--FRE 3529 Aix-Marseille Universit\'e), Christophe, Fouquer\'e (Universit\'e Paris 13, Sorbonne Paris Cit\'e)

TL;DR
This paper presents a constructive method to compute the incarnation of a behaviour in Ludics by using paths instead of chronicles, simplifying the analysis of interaction and minimal denotation of designs.
Contribution
It introduces a new approach to capture the incarnation of a set of designs using paths, avoiding the need to compute the entire behaviour.
Findings
Provides a constructive method for incarnation computation
Uses paths to simplify interaction analysis
Enables minimal denotation of designs and behaviours
Abstract
Ludics is a reconstruction of logic with interaction as a primitive notion, in the sense that the primary logical concepts are no more formulas and proofs but cut-elimination interpreted as an interaction between objects called designs. When the interaction between two designs goes well, such two designs are said to be orthogonal. A behaviour is a set of designs closed under bi-orthogonality. Logical formulas are then denoted by behaviours. Finally proofs are interpreted as designs satisfying particular properties. In that way, designs are more general than proofs and we may notice in particular that they are not typed objects. Incarnation is introduced by Girard in Ludics as a characterization of "useful" designs in a behaviour. The incarnation of a design is defined as its subdesign that is the smallest one in the behaviour ordered by inclusion. It is useful in particular because…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
