Conservative vs set-driven learning functions for the classes κ-valued

In (Buszkowski 1987, Buszkowski and Penn 1990) discovery procedures for CCGs were defined that accept a sequence of structures as input and yield a set of grammars. In (Kanazawa 1998) it N as shown that some of the classes based on these procedures are learnable from structures, and some functions were defined that learn these classes under certain restrictions on their behaviour. Two variants were defined. one that is conservative and one that is guaranteed to be set-driven, The question whether the latter is conservative was still left open, in this paper it is shown that it is not.