TY - JOUR
T1 - May I borrow your logic? (Transporting logical structures along maps)
AU - Cerioli, Maura
AU - Meseguer, José
N1 - * Corresponding author. E-mail: [email protected]. Partially supported by Progetto Finalizzato Sistemi Informatici e Calcolo Parallel0 of CNR (Italy), MURST ~ 40% Modelli e Specifiche di Sistemi Concorrenti and by HCM-Medicis. ’ Partially supported by the US Office of Naval Research under contracts NOOOl4-92-C-0518 and N00014-94-I-0857, NSF Grant CCR-9224005, and by the Information Technology Promotion Agency, Japan, as a part of the Industrial Science and Technology Frontier Program “New Models for Software Architecture” sponsored by NED0 (New Energy and Industrial Technology Development Organization).
PY - 1997/2/28
Y1 - 1997/2/28
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/0031069158
UR - https://www.scopus.com/pages/publications/0031069158#tab=citedBy
U2 - 10.1016/S0304-3975(96)00160-0
DO - 10.1016/S0304-3975(96)00160-0
M3 - Article
AN - SCOPUS:0031069158
SN - 0304-3975
VL - 173
SP - 311
EP - 347
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 2
ER -