, Volume 100, Issue 6, pp 1175-1199
Date: 20 Oct 2012

Metacompleteness of Substructural Logics

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Metacompleteness is used to prove properties such as the disjunction property and the existence property in the area of relevant logics. On the other hand, the disjunction property of several basic propositional substructural logics over FL has been proved using the cut elimination theorem of sequent calculi and algebraic characterization. The present paper shows that Meyer’s metavaluational technique and Slaney’s metavaluational technique can be applied to basic predicate intuitionistic substructural logics and basic predicate involutive substructural logics, respectively. As a corollary of metacompleteness, the disjunction property, the existence property, and the admissibility of certain rules in such logics can be proved.