Locus Solum: From the rules of logic to the logic of rules

@article{Girard2001LocusSF,  title={Locus Solum: From the rules of logic to the logic of rules},  author={Jean-Yves Girard},  journal={Mathematical Structures in Computer Science},  year={2001},  volume={11},  pages={301 - 506},  url={https://api.semanticscholar.org/CorpusID:40722972}}
LUDICS is a monist approach to logic-without this nonsense distinction syntax/semantics/meta - just plain logical artifacts, period.

315 Citations

Proofs, Reasoning and the Metamorphosis of Logic

With the “mathematical watershed”, Logic had been transformed into a foundational theory for mathematics, a theory of truth and proofs—far away from its philosophical status of theory of the…

Playful, streamlike computation

We offer a short tour into the interactive interpretation of sequential programs. We emphasize streamlike computation — that is, computation of successive bits of information upon request. The core…

A gentle introduction to Girard's Transcendental Syntax for the linear logician

    B. Eng
    Mathematics, Philosophy
  • 2020
Thanks to interactive typing, the transcendental syntax is able to reach a semantic-free space where correctness criteria are seen as tests (as in unit testing or model checking) certifying logical correctness, thus allowing an effective use of logical entities.

From Foundations to Ludics

This paper begins with an autopsy, the autopsy of the foundational project, which should explain why logic, especially foundations lost contact with other sciences during last century.

Doing Justice to the Imitation Game

My claim in this article is that the 1950 paper in which Turing describes the world-famous set-up of the Imitation Game is much richer and intriguing than the formalist ersatz coined in the early…

The Frame Problem and the Semantics of Classical Proofs

It is shown that real-world data can be captured using the semantics of classical proofs developed by Bellin, Hyland and Robinson, and, consequently, that the appropriate arena for solutions of the frame problem lies in proof theory.

The Blind Spot: Lectures on Logic

These lectures on logic, more specifically proof theory, are basically intended for postgraduate students and researchers in logic. The question at stake is the nature of mathematical knowledge and…

Polarity and the Logic of Delimited Continuations

    N. Zeilberger
    Computer Science, Philosophy
    2010 25th Annual IEEE Symposium on Logic in…
  • 2010
This work offers a simple account of delimited control, through a natural generalization of the classical notion of polarity, which amounts to breaking the perfect symmetry between positive and negative polarity in the following way: answer types are positive.
...

104 References

A new constructive logic: classic logic

This work follows the order of discovery of the concepts, which (as expected) starts with the semantics and ends with the syntex; it is hoped that this orthogonal look at the same object will help to apprehend the concepts.

Linear logic: its syntax and semantics

The first objection to that view is that there are in mathematics, in real life, cases where reaction does not exist or can be neglected : think of a lemma which is forever true, or of a Mr. Soros, who has almost an infinite amount of dollars.

Geometry of interaction III: accommodating the additives

The paper expounds geometry of interaction, for the first time in the full case, i.e. for all connectives of linear logic, including additives and constants, as well as a slight modification of familiar sequent calculus in the case of exponential-free conclusions.

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments.

A Theory of Objects

This book takes a novel approach to the understanding of object-oriented languages by introducing object calculi and developing a theory of objects around them, which covers both the semantics of objects and their typing rules.

The Mathematics of Sentence Structure

An effective rule (or algorithm) for distinguishing sentences from nonsentences is obtained, which works not only for the formal languages of interest to the mathematical logician, but also for natural languages such as English, or at least for fragments of such languages.

Light affine logic

    Andrea Asperti
    Computer Science, Mathematics
    Proceedings. Thirteenth Annual IEEE Symposium on…
  • 1998
This paper introduces a slight variation of LLL, by adding full weakening, which is called light affine logic, and reduces the logical system from 21 to just 11 rules, and with simpler, traditional sequents.
...

Related Papers

Showing 1 through 3 of 0 Related Papers