Pith. sign in

REVIEW 1 cited by

Introduction to linear logic and ludics, part II

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0501039 v1 pith:UI3ZITKB submitted 2005-01-19 cs.LO

Pierre-Louis Curien (PPS) This is my paper · ORCID
classification cs.LO
keywords logiclinearludicsintroductionpartbeencentralcomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper is the second part of an introduction to linear logic and ludics, both due to Girard. It is devoted to proof nets, in the limited, yet central, framework of multiplicative linear logic and to ludics, which has been recently developped in an aim of further unveiling the fundamental interactive nature of computation and logic. We hope to offer a few computer science insights into this new theory.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Linear Realisability over nets: multiplicatives (long version)

    cs.LO 2024-11 conditional novelty 6.0 of 10

    A cut-elimination based realisability model over proof nets is adequate and complete for MLL and MLL*.

Pith tools