Skip to main content
×
Home
    • Aa
    • Aa

Abstract Beth definability in institutions

  • Marius Petria (a1) and Răzvan Diaconescu
Abstract
Abstract

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.

Copyright
Corresponding author
Current address: University of Edinburgh.E-mail:mariuspyah@yahoo.com
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[4]Jan Bergstra , Jan Heering , and Paul Klint , Module algebra, Journal of the Association for Computing Machinery, vol. 37 (1990), no. 2, pp. 335372.

[5]Michel Bidoit and Rolf Hennicker , On the integration of the observability and reachability concepts, Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'2002), Lecture Notes in Computer Science, vol. 2303, 2002, pp. 2136.

[6]Michel Bidoit and Andrzej Tarlecki , Behavioural satisfaction and equivalence in concrete model categories, Proceedings of the 21st Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science, vol. 1059, Springer Verlag, 1996, pp. 241256.

[8]Tomasz Borzyszkowski , Generalized interpolation in CASL, Information Processing Letters, vol. 76 (2001), pp. 1924.

[10]Maura Cerioli and José Meseguer , May I borrow your logic? (transporting logical structures along maps), Theoretical Computer Science, vol. 173 (1997), pp. 311347.

[11]C. C. Chang and H. J. Keisler , Model theory, North Holland, Amsterdam, 1990.

[13]Răzvan Diaconescu , Extra theory morphisms for institutions: logical semantics for multiparadigm languages, Applied Categorical Structures, vol. 6 (1998), no. 4, pp. 427453, a preliminary version appeared as JAIST Technical Report IS-RR-97-0032F in 1997.

[15]Răzvan Diaconescu , Elementary diagrams in institutions, Journal of Logic and Computation, vol. 14 (2004), no. 5, pp. 651674.

[16]Răzvan Diaconescu , An institution-independent proof of Craig Interpolation Theorem, Studia Logica, vol. 77 (2004), no. 1, pp. 5979.

[17]Răzvan Diaconescu , Interpolation in Grothendieck institutions, Theoretical Computer Science, vol. 311 (2004), pp. 439461.

[19]Răzvan Diaconescu , Proof systems for institutional logic, Journal of Logic and Computation, vol. 16 (2006), pp. 339357.

[22]Theodosis Dimitrakos and Tom Maibaum , On a generalized modularization theorem, Information Processing Letters, vol. 74 (2000), pp. 6571.

[23]J. L. Fiadeiro and J. F. Costa , Mirror, mirror in my hand: A duality between specifications and models of process behaviour, Mathematical Structures in Computer Science, vol. 6 (1996), no. 4, pp. 353373.

[26]Joseph Goguen and Rod Burstall , Institutions: Abstract model theory for specification and programming, Journal of the Association for Computing Machinery, vol. 39 (1992), no. 1, pp. 95146.

[27]Joseph Goguen and Răzvan Diaconescu , Towards an algebraic semantics for the object paradigm, Recent trends in data type specification (Harmut Ehrig and Fernando Orejas , editors), Lecture Notes in Computer Science, vol. 785, Springer, 1994, pp. 134.

[28]Joseph Goguen and Grigore Roşu , Institution morphisms, Formal Aspects of Computing, vol. 13 (2002), pp. 274307.

[29]George Grätzer , Universal algebra, Springer, 1979.

[30]Wilfrid Hodges , Model theory, Cambridge University Press, 1993.

[34]G. Matthiessen , Regular and strongly finitary structures over strongly algebroidal categories, Canadian Journal of Mathematics, vol. 30 (1978), pp. 250261.

[36]José Meseguer , Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, vol. 96 (1992), no. 1, pp. 73155.

[38]Till Mossakowski , Specification in an arbitrary institution with symbols, Recent trends in Algebraic Development Techniques, 14th International Workshop, WADT'99, Bonos, France (C. Choppy , D. Bert , and P. Mosses , editors), Lecture Notes in Computer Science, vol. 1827, Springer-Verlag, 2000, pp. 252270.

[39]Till Mossakowski , Relating CASL with other specification languages: the institution level, Theoretical Computer Science, vol. 286 (2002), pp. 367475.

[43]Pieter-Hendrik Rodenburg , A simple algebraic proof of the equational interpolation theorem, Algebra Universalis, vol. 28 (1991), pp. 4851.

[45]Lutz Schröder , Till Mossakowski , and Christoph Lüth , Type class polymorphism in an institutional framework, Recent trends in Algebraic Development Techniques, 17th International Workshop (WADT 2004) (José Fiadeiro , editor), Lecture Notes in Computer Science, vol. 3423, Springer, Berlin, 2004, pp. 234248.

[47]Andrzej Tarlecki , Bits and pieces of the theory of institutions, Proceedings, Summer Workshop on Category Theory and Computer Programming (David Pitt , Samson Abramsky , Axel Poigneé , and David Rydeheard , editors), Lecture Notes in Computer Science, vol. 240, Springer, 1986, pp. 334360.

[48]Andrzej Tarlecki , On the existence of free models in abstract algebraic institutions, Theoretical Computer Science, vol. 37 (1986), pp. 269304, preliminary version, University of Edinburgh, Computer Science Department, Report CSR-165-84, 1984.

[49]Andrzej Tarlecki , Quasi-varieties in abstract algebraic institutions, Journal of Computer and System Sciences, vol. 33 (1986), no. 3, pp. 333360, original version, University of Edinburgh, Report CSR-173-84.

[50]Andrzej Tarlecki , Moving between logical systems, Recent trends in data type specification (Magne Haveraaen , Olaf Owe , and Ole-Johan Dahl , editors), Lecture Notes in Computer Science, Springer, 1996, pp. 478502.

[52]Paulo Veloso , On pushout consistency, modularity and interpolation for logical specifications, Information Processing Letters, vol. 60 (1996), no. 2, pp. 5966.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×