DocumentCode
3257183
Title
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Author
Basaldella, Michele ; Faggian, Claudia
Author_Institution
RIMS, Kyoto Univ., Kyoto, Japan
fYear
2009
fDate
11-14 Aug. 2009
Firstpage
375
Lastpage
384
Abstract
We prove that is possible to extend Girard´s Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.
Keywords
formal logic; game theory; Ludics; game semantics; interactive type; linear logic; Additives; Automata; Calculus; Computer science; Linearity; Logic programming; System recovery; Testing; Game Semantics; Interactive types; Linear Logic; Ludics;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic In Computer Science, 2009. LICS '09. 24th Annual IEEE Symposium on
Conference_Location
Los Angeles, CA
ISSN
1043-6871
Print_ISBN
978-0-7695-3746-7
Type
conf
DOI
10.1109/LICS.2009.46
Filename
5230561
Link To Document