Results 1 to 10 of about 87 (79)
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazushige Terui
exaly +2 more sources
An Interpretation of CCS into Ludics
Electronic Notes in Theoretical Computer Science, 2018 Abstract Starting from works aimed at extending the Curry-Howard correspondence to process calculi through linear logic, we give another Curry-Howard counterpart for Milner's Calculus of Communicating Systems (CCS) by taking Ludics as the target system.
Virgile Mogbil
exaly +3 more sources
Ludics, dialogue and inferentialism
The Baltic International Yearbook of Cognition, Logic and Communication, 2013 In this paper, we try to show that Ludics, a (pre-)logical framework invented by J-Y. Girard, enables us to rethink some of the relationships between Philosophy, Semantics and Pragmatics.
Alain Lecomte
exaly +3 more sources
Ludics with repetitions (Exponentials, Interactive types and Completeness) [PDF]
Logical Methods in Computer Science, 2011 Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behave well" and react in the same way to a set of tests.
Claudia Faggian, Michele Basaldella
doaj +1 more source
Ludics without Designs I: Triads [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In this paper, we introduce the concept of triad. Using this notion, we study, revisit, discover and rediscover some basic properties of ludics from a very general point of view.
Michele Basaldella
doaj +1 more source
Study of Behaviours via Visitable Paths [PDF]
Logical Methods in Computer Science, 2018 Around 2000, J.-Y. Girard developed a logical theory, called Ludics. This theory was a step in his program of Geometry of Interaction, the aim of which being to account for the dynamics of logical proofs.
Christophe Fouqueré, Myriam Quatrini
doaj +1 more source
On the meaning of logical completeness [PDF]
Logical Methods in Computer Science, 2010 Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs.
Michele Basaldella, Kazushige Terui
doaj +1 more source
, 2023 Fiche outil sur "Ludic", un plugin Moodle permettant d'ajouter des éléments ludiques paramétrables aux enseignements.
Serna, Audrey, Lavoué, Elise
openaire +1 more source
Incarnation in Ludics and maximal cliques of paths [PDF]
Logical Methods in Computer Science, 2013 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.
Myriam Quatrini, Christophe Fouqueré
doaj +1 more source
Argumentation and Inference: A Unified Approach
The Baltic International Yearbook of Cognition, Logic and Communication, 2013 We propose in this paper to use Ludics as a unified framework for the analysis of dialogue and the reasoning system. Not only is Ludics a logical theory, but it may also be built by means of concepts of game theory.
Christophe Fouqueré, Myriam Quatrini
doaj +1 more source