Metacompleteness of substructural logics

DOI10.1007/S11225-012-9458-ZzbMATH Open1268.03024OpenAlexW2094859184MaRDI QIDQ1935554FDOQ1935554

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

Recommendations

• An algebraic approach to the disjunction property of substructural logics
• Disjunction property and complexity of substructural logics
• Structural Completeness in Substructural Logics
• Nonassociative substructural logics and their semilinear extensions: axiomatization and completeness properties
• scientific article; zbMATH DE number 1523044

zbMATH Keywords

admissible rulessubstructural logicsmetacompletenessdisjunction propertyexistence property

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Residuated lattices. An algebraic glimpse at 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
• A metacompleteness theorem for contraction-free relevant logics
• Disjunction and existence under implication in elementary intuitionistic formalisms
• An algebraic approach to the disjunction property of substructural logics
• Title not available (Why is that?)

Cited In (1)

• Formalized meta-theory of sequent calculi for substructural logics

This page was built for publication: Metacompleteness of substructural logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935554)