Metacompleteness of substructural logics

DOI10.1007/S11225-012-9458-ZMaRDI QIDQ1935554zbMATH OpenOpenAlexFDO

Authors 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

admissible rulessubstructural logicsmetacompletenessdisjunction propertyexistence property

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 2062375 (Why is no real title available?)
• scientific article; zbMATH DE number 1907195 (Why is no real title available?)
• A metacompleteness theorem for contraction-free relevant logics
• An algebraic approach to the disjunction property of substructural logics
• 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
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
• Residuated lattices. An algebraic glimpse at substructural logics

Cited in

(4)

• Metavaluations
• Some metacomplete relevant modal logics
• Formalized meta-theory of sequent calculi for substructural logics
• Nonassociative substructural logics and their semilinear extensions: axiomatization and completeness properties

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)