Abstract

this paper are implemented and used for some example logics and sequent calculus proof search. The core inka is implemented in Allegro Common Lisp. The interface runs on distributed Oz, which is available for Unix and Windows. As a next step we intend to integrate a logic for algorithmic function and predicate definitions as well as the methods to prove their termination as tactics. Termination proofs can be inspected and already proven lemmata can be used during the construction of termination proofs, which are the main advantages wrt. the black box implementation of these methods in the old inka system [8]. References

Citations