- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The structure of multiplicatives
Archive for Mathematical Logic 28 (3):181-203 (1989)
Abstract
Investigating Girard's new propositionnal calculus which aims at a large scale study of computation, we stumble quickly on that question: What is a multiplicative connective? We give here a detailed answer together with our motivations and expectationsMy notes
Similar books and articles
A new correctness criterion for multiplicative non-commutative proof nets.Roberto Maieli - 2003 - Archive for Mathematical Logic 42 (3):205-220.
Softness of MALL proof-structures and a correctness criterion with Mix.Masahiro Hamano - 2004 - Archive for Mathematical Logic 43 (6):751-794.
Interaction graphs: Multiplicatives.Thomas Seiller - 2012 - Annals of Pure and Applied Logic 163 (12):1808-1837.
Linear logic with fixed resources.Dmitry A. Archangelsky & Mikhail A. Taitslin - 1994 - Annals of Pure and Applied Logic 67 (1-3):3-28.
Modularity of proof-nets.Roberto Maieli & Quintijn Puite - 2005 - Archive for Mathematical Logic 44 (2):167-193.
Embedding classical logic into basic orthologic with a primitive modality.G. Battilotti - 1998 - Logic Journal of the IGPL 6 (3):383-402.
A New Correctness Criterion For The Proof Nets Of Non-commutative Multiplicative Linear Logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
Ab initio generic structures which are superstable but not ω-stable.Koichiro Ikeda - 2012 - Archive for Mathematical Logic 51 (1):203-211.
A new correctness criterion for the proof nets of non-commutative multiplicative linear logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
Cut elimination for a calculus with context-dependent rules.Birgit Elbl - 2001 - Archive for Mathematical Logic 40 (3):167-188.
Analytics
Added to PP
2013-11-23
Downloads
69 (#82,832)
6 months
12 (#1,086,452)
2013-11-23
Downloads
69 (#82,832)
6 months
12 (#1,086,452)
Historical graph of downloads
Citations of this work
Decision problems for propositional linear logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172.
Games and full completeness for multiplicative linear logic.Abramsky Samson & Jagadeesan Radha - 1994 - Journal of Symbolic Logic 59 (2):543-574.
Complementary Proof Nets for Classical Logic.Gabriele Pulcini & Achille C. Varzi - 2023 - Logica Universalis 17 (4):411-432.
The Geometry of Non-Distributive Logics.Greg Restall & Francesco Paoli - 2005 - Journal of Symbolic Logic 70 (4):1108 - 1126.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-7g5mb uwo