Metacompleteness of substructural logics

DOI10.1007/s11225-012-9458-zzbMath1268.03024OpenAlexW2094859184MaRDI QIDQ1935554

Takahiro Seki

Publication date: 18 February 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-012-9458-z

zbMATH Keywords

substructural logicsadmissible rulesdisjunction propertymetacompletenessexistence property

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Unnamed Item
• Unnamed Item
• Residuated lattices. An algebraic glimpse at substructural logics
• A metacompleteness theorem for contraction-free relevant logics
• An algebraic approach to the disjunction property of substructural logics
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
• Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
• Disjunction and existence under implication in elementary intuitionistic formalisms