In this paper, we consider a set of quite interesting three- and four-valued logics prove the normalisation theorem for their natural deduction formulations. Among in question are Logic Paradox, First Degree Entailment, Strong Kleene logic, some implicative extensions, including RM3 RM3⊃. Also, present detailed version Prawitz’s proof Nelson’s logic N4 its extension by intuitionist negation.

This project presents a simple translation from Uppaal models of real-time controllers to NQC programs. The modeling of these controllers in Uppaal provides a way to verify the requirements on these controllers. The user directs the translation by defining a type for each variable used in the model and by assigning each automaton in the model to a controller. The translation, that has been impl...