Current trends in substructural logics
From MaRDI portal
Publication:266641
DOI10.1007/s10992-015-9346-xzbMath1334.03017OpenAlexW2001724322MaRDI QIDQ266641
Publication date: 13 April 2016
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-015-9346-x
relational semanticsdecidabilitylinear logicsubstructural logicssequent calculicombinatory logicdisplay logicrelevance logics
Related Items (2)
Identity in Mares-Goldblatt models for quantified relevant logic ⋮ An incompleteness theorem for modal relevant logics
Cites Work
- General frames for relevant modal logics
- Linear logic
- Ternary relations and relevant semantics
- New consecution calculi for \(R^{t}_{\to}\)
- Admissibility of cut in LC with fixed point combinator
- Linear logic displayed
- Dual gaggle semantics for entailment
- \(TW_+\) and \(RW_+\) are decidable
- The semantics and proof theory of linear logic
- Decision problems for propositional linear logic
- Classical relevant logics. I
- Classical relevant logics. II
- The semantics of entailment. II
- The semantics of entailment. III
- A Kripke-style semantics for R-mingle using a binary accessibility relation
- Quantification and RM
- A topological representation theory for lattices
- Stone duality for lattices
- Substructural logics: a primer
- Four-valued logic
- Normal modal substructural logics with strong negation
- CE is not a conservative extension of E
- Fragments of R-mingle
- Display logic
- Kripke semantics for modal substructural logics
- Symmetric generalized Galois logics
- Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
- Lambek calculus is NP-complete
- The decidability of the intensional fragment of classical linear logic
- Semantics for structurally free logics LC+
- Kripke models for linear logic
- A completeness theorem in modal logic
- CONSERVATIVITY OF HEYTING IMPLICATION OVER RELEVANT QUANTIFICATION
- The undecidability of entailment and relevant implication
- Combinators and structurally free logic
- Substructural logics on display
- On the decidability of implicational ticket entailment
- Ticket Entailment is decidable
- The complexity of decision procedures in relevance logic II
- Converse Ackermann property and constructive negation defined with a negation connective
- An alternative semantics for quantified relevant logic
- A Decision Procedure For the System EĪ of Entailment with Negation
- Representation of Distributive Lattices by means of ordered Stone Spaces
- The complexity of theorem-proving procedures
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- The Theory of Representation for Boolean Algebras
- Topological representations of distributive lattices and Brouwerian logics
- The completeness of the first-order functional calculus
- Boolean Algebras with Operators. Part I
- Boolean Algebras with Operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Current trends in substructural logics