  This paper concerns a goal directed proof procedure for the propositional
fragment of the adaptive logic ACLuN1. At the propositional level, it forms an
algorithm for final derivability. If extended to the predicative level, it
provides a criterion for final derivability. This is essential in view of the
absence of a positive test. The procedure may be generalized to all flat
adaptive logics.
