Some Computational Aspects of Inconsistency-Adaptive Logics

This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. The procedure forms an algorithm for final derivability and may easily be generalized for the propositional fragment of all flat adaptive logics. The aim is to articulate a procedure that, if extended to the predicative level, provides criteria for