When we transform the representational theory of the boolean concept learning framework to a substructural logic, we do the following: • eliminate the structural rules from the calculus of first order propositional logic When we want to translate the learnability result of k-CNF expressible boolean concepts we need to do the same with the formal learning framework and the strategy (algorithm).
: • the learning framework will contain concepts that are sensitive to the features which were before abstracted by the structural rules ('position' and 'arity' ) • the learning algorithm from above is no longer allowed to use the structural rules in its inductive steps.