May I borrow your logic? Transporting logical structures along maps

被引:42
作者
Cerioli, M
Meseguer, J
机构
[1] STANFORD UNIV, CTR STUDY LANGUAGE & INFORMAT, STANFORD, CA 94305 USA
[2] SRI INT, MENLO PK, CA 94025 USA
基金
美国国家科学基金会;
关键词
D O I
10.1016/S0304-3975(96)00160-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It can be very advantageous to borrow key components of a logic for use in another logic. The advantages are both conceptual and practical; due to the existence of software systems supporting mechanized reasoning in a given logic, it may be possible to reuse a system developed for one logic - for example, a theorem-prover - to obtain a new system for another. Translations between logics by appropriate mappings provide a first natural way of reusing tools of one logic in another. This paper generalizes this idea to the case where entire components - for example, the proof theory - of one of the logics involved may be completely missing, so that the appropriate mapping could not even be defined. The idea then is to borrow the missing components (as well as their associated tools if they exist) from a logic that has them in order to create the full-fledged logic and tools that we desire. The relevant structure is transported using maps that only involve a limited aspect of the two logics in question - for example, their model theory. The constructions accomplishing this kind of borrowing of logical structure are very general and simple. They only depend upon a few abstract properties that hold under very general conditions given a pair of categories linked by adjoint functors.
引用
收藏
页码:311 / 347
页数:37
相关论文
共 35 条
[1]  
[Anonymous], 1985, EATCS MONOGRAPHS THE
[2]  
ASTESIANO E, 1993, LECT NOTES COMPUT SC, V655, P126
[3]  
BURSTALL RM, 1980, LECTURE NOTES COMPUT, V86, P292, DOI DOI 10.1007/3-540-10007-5_41
[4]  
CHEVALLEY C, 1962, UNPUB SEM NOT U CAL
[5]  
COCKETT JRB, 1992, P S APPL CAT COMP SC, P45
[6]  
EHRIG H, 1991, P 2 INT C ALG METH S, P101
[7]  
FIADEIRO J, 1988, LECT NOTES COMPUT SC, V332, P44
[8]  
FUTATSUGI K, 1985, P 12 ACM S PRINC PRO, P52
[9]   LINEAR LOGIC [J].
GIRARD, JY .
THEORETICAL COMPUTER SCIENCE, 1987, 50 (01) :1-102
[10]  
GIRARD JY, 1994, P WORKSH LIN LOG