We build on the analogy between theorem proving and legal reasoning. In the former case it was shown that mechanized reasoning is always achieved provided there is a theory, a control on this theory and some rules governing this controlled theory once introduced in a given environment. We show that it is possible to identify similar conditions for cognitive systems and also in the legal world. ...

We describe an approach to mechanically prove the correctness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages speciied by means of Abstract State Machines 15]. In 31] we decomposed the correctness condition based on these operational semantics into...

Metafunctions: proving them correct and using them eeciently as new proof procedures. In this paper we have presented how computational reeective capabilities and mechanized logical deduction can be integrated. We have explained how this integration is achieved in GETFOL, a theorem prover where a logical metatheory MT describes both the logical properties of the object theory OT and the code im...