A Proof Theoretic Interpretation of Model Theoretic Hiding [chapter]

Mihai Codescu, Fulya Horozal, Michael Kohlhase, Till Mossakowski, Florian Rabe
2012 Lecture Notes in Computer Science  
Logical frameworks like LF are used for formal representations of logics in order to make them amenable to formal machine-assisted meta-reasoning. While the focus has originally been on logics with a proof theoretic semantics, we have recently shown how to dene model theoretic logics in LF as well. We have used this to dene new institutions in the Heterogeneous Tool Set in a purely declarative way. It is desirable to extend this model theoretic representation of logics to the level of
more » ... specications. Here a particular challenge among structured specication building operations is hiding, which restricts a specication to some export interface. Specication languages like ASL and CASL support hiding, using an institution-independent model theoretic semantics abstracting from the details of the underlying logical system. Logical frameworks like LF have also been equipped with structuring languages. However, their proof theoretic nature leads them to a theorylevel semantics without support for hiding. In the present work, we show how to resolve this diculty.
doi:10.1007/978-3-642-28412-0_9 fatcat:x4jaqvw3izgudfzwu3j2nrur7y