## An institutional view on categorical logic and the Curry-Howard-Tait-isomorphism

Citations: | 1 - 1 self |

### BibTeX

@MISC{Mossakowski_aninstitutional,

author = {Till Mossakowski and Florian Rabe and Valeria De Paiva and Lutz Schröder and Joseph Goguen},

title = {An institutional view on categorical logic and the Curry-Howard-Tait-isomorphism },

year = {}

}

### OpenURL

### Abstract

We introduce a generic notion of propositional categorical logic and provide a construction of an institution with proofs out of such a logic, following the Curry-Howard-Tait paradigm. We then prove logic-independent soundness and completeness theorems. The framework is instantiated with a number of examples: classical, intuitionistic, linear and modal propositional logics. Finally, we speculate how this framework may be extended beyond the propositional case.

### Citations

921 | Categories for the working mathematician - Lane - 1998 |

476 |
Institutions: Abstract model theory for specication and programming
- Goguen, Burstall
- 1992
(Show Context)
Citation Context ...puter science as a response to the population explosion among logicssin use, with the ambition of doing as much as possible at a level of abstraction independent of commitment to any particular logic =-=[16, 18]-=-. Its key idea is to focus on abstractly axiomatizing the satisfaction relation between sentences and models. A surprisingly large amount of meta-logical reasoning can be carried out in this abstract ... |

425 |
An Introduction to Higher Order Categorical Logic
- Lambek, Scott
- 1986
(Show Context)
Citation Context ...this context, a number of deep correspondences between categories and logical theories have been established (identifying ‘types’ with ‘objects in a category’): conjunctive logic cartesian categories =-=[19]-=- positive logic cartesian closed categories [19] intuitionistic propositional logic bicartesian closed categories [19] classical propositional logic bicartesian closed categories with [19] ¬¬-eliminat... |

229 |
Abstract and Concrete Categories
- Adámek, Herrlich, et al.
- 1990
(Show Context)
Citation Context ...s, we conclude with some speculations on how to extend this program to other logics. 2 Institutions and Logics We assume that the reader is familiar with basic notions from category theory; e.g., see =-=[1, 20]-=- for introductions to this subject. By way of notation, |C| denotes the class of objects of a category C, and composition is denoted by “◦”. Let CAT be the the quasi-category of all categories (quasi-... |

168 |
General logics
- Meseguer
- 1989
(Show Context)
Citation Context ...ies and programs [29, 10], and substantial portions of classical model theory can be lifted to the level of institutions [34, 7–9]. The notion of institution has been extended to cover also deduction =-=[23]-=- and proof theory [25]. Below, we give a general notion of propositional categorical logic, a construction of an institution with proofs out of such a logic, and logic-independent soundness and comple... |

147 | Rewriting logic as a logical and semantic framework
- Martí-Oliet, Meseguer
- 2000
(Show Context)
Citation Context ...ss [13], behavioural [2], coalgebraic [6], and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic has been introduced in =-=[24, 22]-=- as a model of concurrency that distinguishes equations from rewriting rules and hence naturally leads to notions of rewriting up to associativity, commutativity etc. Here, we will use conditional rew... |

102 | Linear logic, *-autonomous categories and cofree coalgebras
- Seely
- 1989
(Show Context)
Citation Context ...es [19] intuitionistic propositional logic bicartesian closed categories [19] classical propositional logic bicartesian closed categories with [19] ¬¬-elimination linear logic ∗-autonomous categories =-=[33]-=- first-order logic hyperdoctrines [31] Martin-Löf type theory locally cartesian closed categories [32] Here, we present work aimed at casting these correspondences in a common framework based on the t... |

92 | Building specifications in an arbitrary institution
- Sanella, Tarlecki
- 1988
(Show Context)
Citation Context ...isingly large amount of meta-logical reasoning can be carried out in this abstract framework; e.g., institutions have been used to give general foundations for modularization of theories and programs =-=[29, 10]-=-, and substantial portions of classical model theory can be lifted to the level of institutions [34, 7–9]. The notion of institution has been extended to cover also deduction [23] and proof theory [25... |

85 | Logical support for modularisation
- Diaconescu, Goguen, et al.
- 1991
(Show Context)
Citation Context ...isingly large amount of meta-logical reasoning can be carried out in this abstract framework; e.g., institutions have been used to give general foundations for modularization of theories and programs =-=[29, 10]-=-, and substantial portions of classical model theory can be lifted to the level of institutions [34, 7–9]. The notion of institution has been extended to cover also deduction [23] and proof theory [25... |

85 | Towards an algebraic semantics for the object paradigm
- GOGUEN, DIACONESCU
- 1994
(Show Context)
Citation Context ...near logic, by taking judgements of the form ϕ1 . . . ϕn ⊢ ψ as sentences. Also, higher-order [4], polymorphic [30], temporal [13], process [13], behavioural [2], coalgebraic [6], and object-oriented =-=[17]-=- logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic has been introduced in [24, 22] as a model of concurrency that distinguishes equations fro... |

59 |
The Mathematics of Metamathematics
- Rasiowa, Sikorski
- 1963
(Show Context)
Citation Context ...esian closed category) is strongly complete for Prop. For any dense-in-itself metric space X, the Heyting algebra O(X) of open sets in X (qua bicartesian closed category) is weakly complete for IProp =-=[27]-=-. We do not, at present, know whether O(X) is also strongly complete for IProp. Proposition 31. Let L be a categorical logic extending the theory of cartesian closed categories (i.e. minimal intuition... |

58 | Institution morphisms
- Goguen, Ros¸u
- 2002
(Show Context)
Citation Context ...puter science as a response to the population explosion among logicssin use, with the ambition of doing as much as possible at a level of abstraction independent of commitment to any particular logic =-=[16, 18]-=-. Its key idea is to focus on abstractly axiomatizing the satisfaction relation between sentences and models. A surprisingly large amount of meta-logical reasoning can be carried out in this abstract ... |

56 |
Locally cartesian closed categories and type theory
- Seely
- 1984
(Show Context)
Citation Context ...logic bicartesian closed categories with [19] ¬¬-elimination linear logic ∗-autonomous categories [33] first-order logic hyperdoctrines [31] Martin-Löf type theory locally cartesian closed categories =-=[32]-=- Here, we present work aimed at casting these correspondences in a common framework based on the theory of institutions. The notion of institution arose within computer science as a response to the po... |

43 |
Aspects of topoi
- Freyd
- 1972
(Show Context)
Citation Context ...he resulting tuple is in the predicate. This is extended to conditional formulas as usual. (A restricted version of this institution has been introduced under the names essentially algebraic theories =-=[14]-=- and HEP-varieties [28], and has been used in the meta-theory of categories.) Again, there are several proof systems for this institution; e.g. the system in [5] can easily be formalized in such a way... |

37 |
Initial Computability, Algebraic Specifications, and Partial Algebras
- Reichel
- 1987
(Show Context)
Citation Context ...n the predicate. This is extended to conditional formulas as usual. (A restricted version of this institution has been introduced under the names essentially algebraic theories [14] and HEP-varieties =-=[28]-=-, and has been used in the meta-theory of categories.) Again, there are several proof systems for this institution; e.g. the system in [5] can easily be formalized in such a way that PHorn = becomes a... |

31 | On the Existence of Free Models in Abstract Algebraic Institutions - Tarlecki - 1985 |

21 | On the integration of observability and reachability concepts
- Bidoit, Hennicker
- 2002
(Show Context)
Citation Context ...tions. So can substructural logics like linear logic, by taking judgements of the form ϕ1 . . . ϕn ⊢ ψ as sentences. Also, higher-order [4], polymorphic [30], temporal [13], process [13], behavioural =-=[2]-=-, coalgebraic [6], and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic has been introduced in [24, 22] as a model of c... |

21 | Order-enriched categorical models of the classical sequent calculus
- Führmann, Pym
- 2004
(Show Context)
Citation Context ...tional structure sheds light on the usual collapsing problem (classical bicartesian closed categories are boolean algebras); the collapsing can be avoided by using preorder-enriched categories, as in =-=[15]-=-. We have proved generic deduction, soundness, and completeness theorems. Moreover, while trying to recover the Curry-Howard-Tait isomorphism as an explicit isomorphism between institution, only a lim... |

19 | On an intuitionistic modal logic
- Bierman, Paiva
(Show Context)
Citation Context ...f excluded middle. Example 11 (Modal logic). Extend IP rop from Example 9 by adding operations ✷, ✸: Ob → Ob modeling the necessity and possibility operators from constructive modal S4, as defined by =-=[3]-=-. The necessity modality corresponds to a monoidal comonad, while the possibility modality corresponds to a monad, which is strong relative to the necessity comonad. Example 12 (Linear logic). For a d... |

19 | From total equational to partial first order logic
- Cerioli, Mossakowski, et al.
- 1999
(Show Context)
Citation Context ... names essentially algebraic theories [14] and HEP-varieties [28], and has been used in the meta-theory of categories.) Again, there are several proof systems for this institution; e.g. the system in =-=[5]-=- can easily be formalized in such a way that PHorn = becomes a preordcat/cat institution. Moreover, intuitionistic and modal logics can be formalized as institutions. So can substructural logics like ... |

19 | An Institution-Independent Proof of Craig Interpolation Property - Diaconescu |

18 |
Elementary diagrams in institutions
- Diaconescu
(Show Context)
Citation Context ... and Boolvalued models. We have provided some general result about the relations between such models. An interesting question is whether the institutions I(L) have elementary diagrams in the sense of =-=[8]-=-. Our current notion of model is obviously too weak to ensure this; for ensuring elementary diagrams one would need “intensional models” over signatures containing proof variables, to be valuated with... |

15 | Institution-Independent Ultraproducts - Diaconescu - 2003 |

14 | Relating categorical semantics for intuitionistic linear logic. Applied Categorical Structures 13(1
- Maietti, Maneggia, et al.
- 2005
(Show Context)
Citation Context ...perations ⊗, ⊸, ! modeling, respectively, multiplicative conjunction, linear implication and the exponential operator “of course!”. This corresponds to an autonomous category with a ’linear’ comonad, =-=[21]-=-. 6s5 The Institutional Curry-Howard-Tait Construction We now recast the Curry-Howard-Tait interpretation of categorical logic in an institutional setting. Given a categorical logic L, let C(L) be the... |

14 |
Natural Deduction and the Beck Condition, Zeitschr. f. math. Logik und Grundlagen d
- Seely, Hyperdoctrines
- 1983
(Show Context)
Citation Context ...ogic bicartesian closed categories [19] classical propositional logic bicartesian closed categories with [19] ¬¬-elimination linear logic ∗-autonomous categories [33] first-order logic hyperdoctrines =-=[31]-=- Martin-Löf type theory locally cartesian closed categories [32] Here, we present work aimed at casting these correspondences in a common framework based on the theory of institutions. The notion of i... |

12 | Type class polymorphism in an institutional framework
- Schröder, Mossakowski, et al.
- 2004
(Show Context)
Citation Context ...c and modal logics can be formalized as institutions. So can substructural logics like linear logic, by taking judgements of the form ϕ1 . . . ϕn ⊢ ψ as sentences. Also, higher-order [4], polymorphic =-=[30]-=-, temporal [13], process [13], behavioural [2], coalgebraic [6], and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic h... |

11 | Mirror, mirror in my hand... a duality between specifications and models of process behaviour
- Fiadeiro, Costa
- 1996
(Show Context)
Citation Context ...ics can be formalized as institutions. So can substructural logics like linear logic, by taking judgements of the form ϕ1 . . . ϕn ⊢ ψ as sentences. Also, higher-order [4], polymorphic [30], temporal =-=[13]-=-, process [13], behavioural [2], coalgebraic [6], and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic has been introdu... |

10 | Moving specification structures between logical systems. Recent Trends
- Borzyszkowski
- 1998
(Show Context)
Citation Context ...er, intuitionistic and modal logics can be formalized as institutions. So can substructural logics like linear logic, by taking judgements of the form ϕ1 . . . ϕn ⊢ ψ as sentences. Also, higher-order =-=[4]-=-, polymorphic [30], temporal [13], process [13], behavioural [2], coalgebraic [6], and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional... |

9 | What is a logic
- Mossakowski, Diaconescu, et al.
- 2005
(Show Context)
Citation Context ...10], and substantial portions of classical model theory can be lifted to the level of institutions [34, 7–9]. The notion of institution has been extended to cover also deduction [23] and proof theory =-=[25]-=-. Below, we give a general notion of propositional categorical logic, a construction of an institution with proofs out of such a logic, and logic-independent soundness and completeness theorems. We th... |

8 |
Institutionalising many-sorted coalgebraic modal logic
- Cîrstea
- 2002
(Show Context)
Citation Context ...structural logics like linear logic, by taking judgements of the form ϕ1 . . . ϕn ⊢ ψ as sentences. Also, higher-order [4], polymorphic [30], temporal [13], process [13], behavioural [2], coalgebraic =-=[6]-=-, and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic has been introduced in [24, 22] as a model of concurrency that d... |

7 |
Cut Elimination in Categories
- Do˘sen
- 1999
(Show Context)
Citation Context ...l rewrites correspond to the various cases and subcases of the induction step of a constructive cut elimination proof. For the simple case of a cartesian logic a cut elimination proof can be found in =-=[12]-=-. An example for a rewrite that needs to be added to yield cut elimination is 〈f, g〉 ◦ h ❀ 〈f ◦ h, g ◦ h〉; this rewrite replaces one top-level cut with two lower-level cuts. Example 19. Consider the t... |

3 |
Conditional rewriting as a unified model of concurrency. Theoretical computer science 96(1
- Meseguer
- 1992
(Show Context)
Citation Context ...ss [13], behavioural [2], coalgebraic [6], and object-oriented [17] logics have been shown to be institutions. 3 Partial Conditional Rewriting Logic Conditional rewriting logic has been introduced in =-=[24, 22]-=- as a model of concurrency that distinguishes equations from rewriting rules and hence naturally leads to notions of rewriting up to associativity, commutativity etc. Here, we will use conditional rew... |