The semantics and proof theory of linear logic
From MaRDI portal
DOI10.1016/0304-3975(88)90037-0zbMATH Open0652.03018OpenAlexW1974484530MaRDI QIDQ1106836FDOQ1106836
Authors: Arnon Avron 
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90037-0
Recommendations
Cites Work
- Title not available (Why is that?)
- The undecidability of entailment and relevant implication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- Simple consequence relations
- Relevant entailment—semantics and formal systems
- Using typed lambda calculus to implement formal systems on a machine
Cited In (94)
- What is relevance logic?
- The logics of strict-tolerant logic
- A family of metainferential logics
- Condensed detachment is complete for relevance logic: A computer-aided proof
- Correctness of linear logic proof structures is NL-complete
- Current trends in substructural logics
- Title not available (Why is that?)
- Logical consequence and the paradoxes
- Natural 3-valued logics—characterization and proof theory
- Prior's OIC nonconservativity example revisited
- Linear logic
- Inferences and metainferences in \(\mathsf{ST}\)
- Correspondences between gentzen and hilbert systems
- Title not available (Why is that?)
- Linear logic displayed
- Language in action
- Natural deduction bottom up
- Decision problems for propositional linear logic
- Abstract argumentation systems
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
- Contextual deduction theorems
- Some Properties of Linear Logic Proved by Semantic Methods
- Logic and Exceptions: A Few Remarks
- Hypersequents, logical consequence and intermediate logics for concurrency
- Idempotent residuated structures: Some category equivalences and their applications
- Linear logic I. The Linear Logic 96 Tokyo Meeting, Mita Campus of Keio Univ., Tokyo, Japan, March 28 -- April 2, 1996
- ASSERTIONALLY EQUIVALENT QUASIVARIETIES
- What is a paraconsistent logic?
- Fragments of R-mingle
- A fully classical truth theory characterized by substructural means
- Investigations into a left-structural right-substructural sequent calculus
- A syntax for linear logic
- Naive truth and naive logical properties
- Formalization of linear space theory in the higher-order logic proving system
- Functional completeness for subsystems of intuitionistic propositional logic
- Exploring the gap between linear and classical logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- On linear Brouwerian logics
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Simple consequence relations
- A linear conservative extension of Zermelo-Fraenkel set theory
- \(\bigstar\)-autonomous lattices
- Representable idempotent commutative residuated lattices
- Finite games for a predicate logic without contractions
- Gentzenizations of relevant logics without distribution. I
- Deep \textsf{ST}
- The decidability of the intensional fragment of classical linear logic
- A structural approach to reversible computation
- Non-normal modalities in variants of linear logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A category equivalence for odd Sugihara monoids and its applications
- A decision procedure revisited: Notes on direct logic, linear logic and its implementation
- Kripke models for linear logic
- Effective Finite-Valued Approximations of General Propositional Logics
- An abstract approach to consequence relations
- Some Syntactical Observations on Linear Logic
- Linear Logic and Strong Normalization
- External curries
- Autonomous posets and quantales
- Axioms and models of linear logic
- An introduction to differential linear logic: proof-nets, models and antiderivatives
- Modal translations in substructural logics
- Multiplicative conjunction and an algebraic meaning of contraction and weakening
- A simple logical matrix and sequent calculus for Parry's logic of analytic implication
- Informational interpretation of substructural propositional logics
- On two fragments with negation and without implication of the logic of residuated lattices
- On the infinite-valued Łukasiewicz logic that preserves degrees of truth
- Using typed lambda calculus to implement formal systems on a machine
- Implication, Equivalence, and Negation
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- Title not available (Why is that?)
- A SUBSTRUCTURAL GENTZEN CALCULUS FOR ORTHOMODULAR QUANTUM LOGIC
- Prawitz, Proofs, and Meaning
- On three implication-less fragments of t-norm based fuzzy logics
- Fibred tableaux for multi-implication logics
- Title not available (Why is that?)
- Semantical observations on the embedding of Intuitionistic Logic into Intuitionistic Linear Logic
- Theorems of Alternatives for Substructural Logics
- Interpolation in linear logic and related systems
- Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
- Editorial introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequent calculi for first-order ST
- Relevant consequence relations: an invitation
- Non-reflexive nonsense: proof theory of paracomplete weak Kleene logic
- Interpretations of weak positive modal logics
- The logical structure of linguistic commitment. III: Brandomian scorekeeping and incompatibility
- Linear Logic Properly Displayed
- A simplified account of the metatheory of linear LF
- Semi-implication: a chapter in universal logic
- The original sin of proof-theoretic semantics
This page was built for publication: The semantics and proof theory of linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106836)
