On a General Notion of a Hull
In this contribution we give a short presentation of ongoing work in the areas of the general framework and mathematical foundations in MEDLAR II. Our objective is to sketch a brief survey of the problems, the methods and existing results and we conclude with prospects of work in progress. We start with some background information and motivational remarks which form the basis of the subsequent considerations. As mentioned in the following, joint article with K. Stokkermans the logical fiberings (as introduced in Pfalzgraf 1991) provide semantical models for indexed systems of logics and they have (semantical) links to D. Gabbay’s extensive theory of labelled deductive systems (LDS). He sees the logical fiberings as a (general) semantics for LDS and introduced the notion of “fibered semantics.” The LDS form a general framework for the great challenge of “putting logics together” in an integrated system (cf. Gabbay 1990, 1994a, b). This indicates the central interest of fibered structures concerning a general semantics modeling approach. Compare the “sheaf semantics” arising naturally in our subsequent considerations.
KeywordsCategory Theory Universal Property Deductive System Heyting Algebra Transitive Relation
Unable to display preview. Download preview PDF.
- Gabbay, D. (1990): Labelled deductive systems, Part I. CIS, University of Munich, CIS-Bericht 90-22.Google Scholar
- Gabbay, D. (1994a): Labelled deductive systems — a position paper. In: Vaananen, J., Oikkonen, J. (eds.): Logic Colloquium 90. Springer, Berlin Heidelberg New York Tokyo [Slaman, T., et al. (eds.): Lecture notes in logic, vol. 2] (to appear).Google Scholar
- Gabbay, D. (1994b): Classical vs non-classical logic. In: Gabbay, D., Hogger, C., Robinson, J. (eds.): Handbook of logic in AI and logic programming, vol. 2. Oxford University Press, Oxford, pp. 359–500.Google Scholar
- MacLane, S. (1971): Categories for the working mathematician. Springer, Berlin Heidelberg New York Tokyo (Graduate texts in mathematics, vol. 5).Google Scholar
- Ohlbach, H.-J. (1994): Synthesizing semantics for extension of propositional logic. Internal report (draft), Max Planck Institut für Informatik, Saarbrücken.Google Scholar
- Pierce, B. C. (1991): Basic category theory for computer scientists. MIT Press, Cambridge, MA.Google Scholar
- Stokkermans, K. (1992): A categorical formulation for critical-pair/completion procedures. In: Rusinowitch, M., Rémy, J.-L. (eds.): Conditional term rewriting systems. Springer, Berlin Heidelberg New York Tokyo, pp. 328–342 (Lecture notes in computer science, vol. 656).Google Scholar