- Ludics
In
proof theory , ludics is an analysis of the principles governing inference rules ofmathematical logic . Key features of ludics are its notion of compound connectives using a technique known as "focusing" or "focalisation" (invented by the computer scientistJean-Marc Andreoli ), and its use of "locations" or "loci" over a base instead of propositions.More precisely, ludics tries to retrieve known
logical connective s, and proof behaviours, by following the paradigm of interactive computation, similarly to what is done ingame semantics to which it is closely related. By abstracting the notion of formulae and focusing of their concrete uses, that is distinct occurrences, it allows to provide an abstract syntax forcomputer science , as loci can be seen as pointers on memory.Ludics was proposed by the
logician Jean-Yves Girard . His paper introducing Ludics, "Locus solum: from the rules of logic to the logic of rules", has some features that may be seen as eccentric for a publication inmathematical logic (such as illustrations of Positive Skunks). It has to be noted, that the intent of these features is to enforce the point of view ofJean-Yves Girard at the time of its writing. And, thus, it offers to readers the possibility to understand ludics independently of their backgrounds.ee also
*
Linear logic
*Game semantics External links
* Girard, J-Y, [http://iml.univ-mrs.fr/~girard/0.ps.gz "Locus solum": from the rules of logic to the logic of rules] (.ps.gz), "Mathematical Structures in Computer Science", 11, 301–506, 2001.
Wikimedia Foundation. 2010.
