The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Quantales and (noncommutative) linear logic
Abstract
It is the purpose of this paper to make explicit the connection between J.-Y. Girard's “linear logic” [4], and certain models for the logic of quantum mechanics, namely Mulvey's “quantales” [9]. This will be done not only in the case of commutative linear logic, but also in the case of a version of noncommutative linear logic suggested, but not fully formalized, by Girard in lectures given at McGill University in the fall of 1987 [5], and which for reasons which will become clear later we call “cyclic linear logic”. For many of our results on quantales, we rely on the work of Niefield and Rosenthal [10]. The reader should note that by “the logic of quantum mechanics” we do not mean the lattice theoretic “quantum logics” of Birkhoff and von Neumann [1], but rather a logic involving an associative (in general noncommutative) operation “and then”. Logical validity is intended to embody empirical verification (whether a physical experiment, or running a program), and the validity of A & B (in Mulvey's notation) is to be regarded as “we have verified A, and then we have verified B”. (See M. D. Srinivas [11] for another exposition of this idea.) This of course is precisely the view of the “multiplicative conjunction”, ⊗, in the phase semantics for Girard's linear logic [4], [5]. Indeed the quantale semantics for linear logic may be regarded as an element-free version of the phase semantics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Logic of Quantum Mechanics
Birkhoff, G., & Neumann, J. V. (1936) · The Annals of Mathematics · doi:10.2307/1968621 · Cited by 2,831
Simple Word Problems in Universal Algebras
Knuth, D. E., & BENDIX, P. B. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_23 · Cited by 1,368
Computational Problems in Abstract Algebra
(1970) · Elsevier eBooks · doi:10.1016/c2013-0-02156-1 · Cited by 634
Braided compact closed categories with applications to low dimensional topology
Freyd, P. J., & Yetter, D. N. (1989) · Advances in Mathematics · doi:10.1016/0001-8708(89)90018-2 · Cited by 281
Self-citationFoundations of a quantum probability theory
Srinivas, M. D. (1975) · Journal of Mathematical Physics · doi:10.1063/1.522736 · Cited by 49
Cited by
A calculus for access control in distributed systems
Abadi, M., Burrows, M., Lampson, B., & Plotkin, G. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/155183.155225 · Cited by 575
Metadata
- Authors
- Yetter, D. N.
- Venue
- Journal of Symbolic Logic
- Publisher
- Cambridge University Press (CUP)
- Published
- 1990-03
- Volume
- 55
- Issue
- 1
- Pages
- 41-64
- ISSN
- 0022-4812 (ISSN-L)
- 1943-5886
- OpenAlex
- W2078432227
- Cited by
- 313
- References
- 6
- FWCI
- 8.29
- 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: Quantales and (noncommutative) linear logic. https://app.cochat.ai/papers/10.2307/2274953
- The paper
- Yetter, D. N. (1990). Quantales and (noncommutative) linear logic. Journal of Symbolic Logic. https://doi.org/10.2307/2274953
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.