A syntactic approach to Maksimova's principle of variable separation for some substructural logics
DOI10.1305/NDJFL/1039293022zbMath0967.03017OpenAlexW1975359978MaRDI 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 proofprinciple of variable separationproof-theoretic approachpropositional formulasprovabilitysubstructural logics
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (1)
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
This page was built for publication: A syntactic approach to Maksimova's principle of variable separation for some substructural logics