\(TW_+\) and \(RW_+\) are decidable

DOI10.1007/BF00249365zbMath0587.03014OpenAlexW2043493426MaRDI QIDQ1072541

Steve Giambrone

Publication date: 1985

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00249365

zbMATH Keywords

proof theoryGentzen systemsdecision proceduresticket entailmentrelevant implicationconsecution calculicontractionless relevant logicspositive fragments

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (15)

Current trends in substructural logics ⋮ Temporal BI: proof system, semantics and translations ⋮ A note on an alternative Gentzenization of RW+∘ ⋮ An alternative Gentzenisation of RW+∘ ⋮ Completeness and conservative extension results for some Boolean relevant logics ⋮ Residuated Structures, Concentric Sums and Finiteness Conditions ⋮ Modal translations in substructural logics ⋮ Solution to a problem of Ono and Komori ⋮ A syntactic approach to Maksimova's principle of variable separation for some substructural logics ⋮ Four relevant Gentzen systems ⋮ Gentzenization and decidability of some contraction-less relevant logics ⋮ A cut-elimination proof in positive relevant logic with necessity ⋮ Distributive full Lambek calculus has the finite model property ⋮ Solution to a problem of Ono and Komori ⋮ The Universal Theory Tool Building Toolkit Is Substructural

This page was built for publication: \(TW_+\) and \(RW_+\) are decidable