A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of substructural logics. Such a basis is founded on structurally-free logic, a logic in which the usual structural rules are replaced by complex combinator rules, and thus constitute a generalization of traditional sequent systems. A family of substructural logics is identified by the set of structural rules admissible todoi:10.1093/jigpal/6.3.425 fatcat:kayaq3ot4jb3njdww3km3mmulu