A new constructive logic: classic logic
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
There are two ways to present this work; the most efficient is of course to start with the main syntactical definitions, and to end with semantics: this is the presentation that we follow in the body of the text: section 1, syntex; section 2, semantics. Another possibility is to follow the order of discovery of the concepts, which (as expected) starts with the semantics and ends with the syntex; we adopt this second way for our introduction, hoping that this orthogonal look at the same object will help to apprehend the concepts.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
Self-citationLinear objects: Logical processes with built-in inheritance
Andreoli, J., & Pareschi, R. (1991) · New Generation Computing · doi:10.1007/bf03037173 · Cited by 232
Cited by
Games and Full Completeness for Multiplicative Linear Logic
Abramsky, S., & Jagadeesan, R. (1994) · Journal of Symbolic Logic · doi:10.2307/2275407 · Cited by 378
Locus Solum: From the rules of logic to the logic of rules
GIRARD, J.-Y. (2001) · Mathematical Structures in Computer Science · doi:10.1017/s096012950100336x · Cited by 267
Self-citationWadler, P. (2012) · Proceedings of the 17th ACM SIGPLAN international conference on Functional programming · doi:10.1145/2364527.2364568 · Cited by 162
“Girard’s original takes (A → B)◦ = !A◦( B◦, and corresponds to call-by-name, while a lesser known alternative takes (A→ B)∗ = !(A∗( B∗), and correspond to call-by-value (see Benton and Wadler (1996) and Toninho et al.”
Influential
Metadata
- Authors
- Girard, J.-Y.
- Venue
- Mathematical Structures in Computer Science
- Publisher
- Cambridge University Press (CUP)
- Published
- 1991-11
- Volume
- 1
- Issue
- 3
- Pages
- 255-296
- ISSN
- 0960-1295 (ISSN-L)
- 1469-8072
- OpenAlex
- W1985185257
- Cited by
- 307
- References
- 2
- FWCI
- 8.03
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A new constructive logic: classic logic. https://app.cochat.ai/papers/10.1017/s0960129500001328
- The paper
- Girard, J.-Y. (1991). A new constructive logic: classic logic. Mathematical Structures in Computer Science. https://doi.org/10.1017/s0960129500001328
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.