Results 1 
6 of
6
General logics
 In Logic Colloquium 87
, 1989
"... theory, categorical logic. model theory that emerged in computer science studies of software specification and semantics. To handle proof theory, our institutions use an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms repre ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
theory, categorical logic. model theory that emerged in computer science studies of software specification and semantics. To handle proof theory, our institutions use an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms representing proofs as usual. A natural equivalence relation on institutions is defined such that its equivalence classes are logics. Several invariants are defined for this equivalence, including a Lindenbaum
What is a Logic? In memoriam Joseph Goguen
"... model theory that emerged in computer science studies of software specification and semantics. To handle proof theory, our institutions use an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms representing proofs as usual. A ..."
Abstract
 Add to MetaCart
model theory that emerged in computer science studies of software specification and semantics. To handle proof theory, our institutions use an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms representing proofs as usual. A natural equivalence relation on institutions is defined such that its equivalence classes are logics. Several invariants are defined for this equivalence, including a Lindenbaum
An Axiomatic Approach to Structuring Specifications
"... In this paper we develop an axiomatic approach to structured specifications in which both the underlying logical system and corresponding institution of the structured specifications are treated as abstract institutions, which means two levels of institution independence. This abstract axiomatic app ..."
Abstract
 Add to MetaCart
In this paper we develop an axiomatic approach to structured specifications in which both the underlying logical system and corresponding institution of the structured specifications are treated as abstract institutions, which means two levels of institution independence. This abstract axiomatic approach provides a uniform framework for the study of structured specifications independently from any actual choice of specification building operators, and moreover it unifies the theory and the model oriented approaches. Within this framework we develop concepts and results about ‘abstract structured specifications ’ such as colimits, model amalgamation, compactness, interpolation, sound and complete proof theory, and pushoutstyle parameterization with sharing, all of them in a top down manner dictated by the upper level of institution independence. 1.
Borrowing Interpolation
"... We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the socaled ‘institution theory ’ which is a categorical abstract model theory providing a formal definition for the informal concept of ‘logical system ’ and ..."
Abstract
 Add to MetaCart
We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the socaled ‘institution theory ’ which is a categorical abstract model theory providing a formal definition for the informal concept of ‘logical system ’ and a mathematical concept of ‘homomorphism ’ between logical systems. We develop three different styles or patterns to apply the proposed borrowing interpolation method. These three ways are illustrated by the development of a series of concrete interpolation results for logical systems that are used in mathematical logic or in computing science, most of these interpolation properties apparently being new results. These logical systems include fragments of (classical many sorted) first order logic with equality, preordered algebra and its Horn fragment, partial algebra, higher order logic. Applications are also expected for many other logical systems, including membership algebra, various types of order sorted algebra, the logic of predefined types, etc., and various combinations of the logical systems discussed here. 1.