September 2006 Abstract Beth definability in institutions
Răzvan Diaconescu, Marius Petria
J. Symbolic Logic 71(3): 1002-1028 (September 2006). DOI: 10.2178/jsl/1154698588


This paper studies definability within the theory of institutions, a version of abstract model theory that emerged in computing science studies of software specification and semantics. We generalise the concept of definability to arbitrary logics, formalised as institutions, and we develop three general definability results. One generalises the classical Beth theorem by relying on the interpolation properties of the institution. Another relies on a meta Birkhoff axiomatizability property of the institution and constitutes a source for many new actual definability results, including definability in (fragments of) classical model theory. The third one gives a set of sufficient conditions for ‘borrowing’ definability properties from another institution via an ‘adequate’ encoding between institutions. The power of our general definability results is illustrated with several applications to (many-sorted) classical model theory and partial algebra, leading for example to definability results for (quasi-)varieties of models or partial algebras. Many other applications are expected for the multitude of logical systems formalised as institutions from computing science and logic.


Download Citation

Răzvan Diaconescu. Marius Petria. "Abstract Beth definability in institutions." J. Symbolic Logic 71 (3) 1002 - 1028, September 2006.


Published: September 2006
First available in Project Euclid: 4 August 2006

zbMATH: 1110.03064
MathSciNet: MR2251552
Digital Object Identifier: 10.2178/jsl/1154698588

Rights: Copyright © 2006 Association for Symbolic Logic


This article is only available to subscribers.
It is not available for individual sale.

Vol.71 • No. 3 • September 2006
Back to Top