A syntactic approach to Maksimova's principle of variable separation for some substructural logics
From MaRDI portal
Publication:5937808
DOI10.1305/ndjfl/1039293022zbMath0967.03017MaRDI QIDQ5937808
Hiroyuki Naruse, Bayu Surarso, Hiroakira Ono
Publication date: 17 July 2001
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1039293022
cut-free proof; principle of variable separation; proof-theoretic approach; propositional formulas; provability; substructural logics
03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
03F03: Proof theory in general (including proof-theoretic semantics)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(TW_+\) and \(RW_+\) are decidable
- Interpolation properties of superintuitionistic logics
- The principle of separation of variables in propositional logics
- Cut-elimination theorem for relevant logics
- On variable separation in modal and superintuitionistic logics
- Logics without the contraction rule
- The undecidability of the disjunction property of propositional logics and other related problems
- Solution to a problem of Ono and Komori