Towards a uniform presentation of logical systems by indexed categories and adjoint situations

  title={Towards a uniform presentation of logical systems by indexed categories and adjoint situations},
  author={Uwe Wolter and Alfio Martini and Edward Hermann Haeusler},
  journal={J. Log. Comput.},
Logical Systems are paramount to almost every subject in computer science. This vast number of application areas had a deep influence on us and thus on how we perceive what a formal specification of a logical system should be. Lawvere s [29, 30] essential idea is that the fundamental relationship between syntax and semantics can be precisely formulated by adjoint functors. In this work, we show that Institutions from Goguen and Burstall [19] and Entailment Systems from Meseguer [36] are in its… 

Logics of Statements in Context-Category Independent Basics

It is shown how to define, in a category independent way, arbitrary first-order statements in arbitrary contexts, and it is outlined that the universal method to define sketch constraints enables us to establish and to work with conceptual hierarchies of sketches.

Homotopical Categories of Logics

Categories of logics and translations usually come with a natural notion of when a translation is an equivalence. The datum of a category with a distinguished class of weak equivalences places one

Indexed and fibered structures for partial and total correctness assertions

This work focuses on partial and total correctness assertions within the framework of Hoare logic and shows that a comprehensive categorical analysis of its axiomatic semantics needs the languages of indexed and fibered category theory.

Yet another argument in favour of NP=CoNP

This article shows yet another proof of NP = CoNP, also providing polynomial size and polynometric verifiable certificates that are Dags, generated from normal Natural Deduction proofs, linear height upper-bounded too, by removing redundancy.



Shedding the New Light in the World of Logical Systems

The notion of an Institution [5] is here taken as the precise formulation for the notion of a logical system. By using elementary tools from the core of category theory, we are able to reveal the

What is a Logic

This paper builds on the theory of institutions, a version of abstract model theory that emerged in computer science studies of software specification and semantics that uses an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms representing proofs as usual.

Institutions: abstract model theory for specification and programming

This paper says that any institution such that signatures can be glued together, also allows gluing together theories (which are just collections of sentences over a fixed signature), and shows how to define institutions that allow sentences and constraints from two or more institutions.

Structuring Theories on Consequence

The notion of π-institution is proposed as an alternative to the notion of institution, replacing the notions of model and satisfaction by a primitive consequence operator in the definition of a logic.

Relating Categorical Semantics for Intuitionistic Linear Logic

It is pointed out that mere soundness and completeness of a linear typed calculus with respect to a class of categorical models are not sufficient to identify the most appropriate class uniquely.

Fibred and Indexed Categories for Abstract Model Theory

The notions of indexed and fibred frames are introduced and a rich mathematical workspace where many relevant and useful concepts of logics can be elegantly modelled is constructed.

General Logics