Skip to main content
SpringerLink
Log in

An Institution-independent Proof of the Beth Definability Theorem

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

A few results generalizing well-known classical model theory ones have been obtained in institution theory these last two decades (e.g. Craig interpolation, ultraproduct, elementary diagrams). In this paper, we propose a generalized institution-independent version of the Beth definability theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aiguier, M., C. Gaston, and P. Le Gall, ‘Feature Specification: a Logic-Independent Approach’, Tech. rep., Université d’Évry, 2004.

  2. Aiguier, M., and P.-Y. Schobbens, ‘A Note on Robinson Consistency Lemma’, Tech. rep., Université d’Évry, 2006. Available at www.ibisc.univ-evry.fr/~aiguier.

  3. Barwise J (1974) ‘Axioms for Abstract Model Theory’. Annals of Mathematical Logic 7: 221–265

    Article  Google Scholar 

  4. Borzyszkowski, T., ‘Generalized Interpolation in CASL’, Information Processing letters, (2001).

  5. Borzyszkowski T. (2002) ‘Logical Systems for Structured Specifications’. Theoretical Computer Science 286: 197–245

    Article  Google Scholar 

  6. Diaconescu R., (2002). ‘Herbrand Theorems in Arbitrary Institutions’. Information Processing Letters 90(1): 29–39.

    Article  Google Scholar 

  7. Diaconescu R. (2003). ‘Institution-Independent Ultraproducts’. Fundamenta Informaticae 55(3-4): 321–348.

    Google Scholar 

  8. Diaconescu R. (2004) ‘An Institution-Independent Proof of Craig Interpolation Property’. Studia Logica 77(1): 59–79

    Article  Google Scholar 

  9. Diaconescu R. (2004) ‘Interpolation in Grothendieck Institutions’. Theoretical Computer Science 55(3-4): 321–348

    Google Scholar 

  10. Diaconescu, R., J.A. Goguen, and P. Stefaneas, ‘Logical Support for Modularisation’, in G. Huet, and G. Plotkin, (eds.), Logical Environment, 1993, pp. 83–130.

  11. Dimitrakos T., and Maibaum T. (2000) ‘On a Generalized Modularization Theorem’. Information Processing Letter 74: 65–71

    Article  Google Scholar 

  12. Fine K. (1979) ‘Failures for the Interpolation Lemma in Quantified Modal Logic’. Journal of Symbolic Logic 44: 201–206

    Article  Google Scholar 

  13. Gabbay D., and Maksimova L. (2004) Interpoation and Definability Volume 1. Clarendon Press, Oxford

    Google Scholar 

  14. Găină D., and Popescu A. (2007) ‘An Institution-Independent Proof of Robinson Consistency Theorem’. Studia Logica 85(1): 41–73

    Article  Google Scholar 

  15. Goguen, J., and R. Burstall, ‘A Study in the Foundation of Programming Methodology: Specifications, Institutions, Charters and Parchments’, in D Pitt, S. Abramsky, A. Poigné, and D. Rydeheard, (eds.), Proceedings of the Conference on CategoryTheory and Computer Programming, vol. 240 of Lecture Notes in Computer Science, Springer Verlag, 1985, pp. 313–333.

  16. Goguen J., and Burstall R. (1992) ‘Institutions: Abstract Model Theory for Specification and Programming’. Journal of the Association for Computing Machinery 39(1): 95–146

    Google Scholar 

  17. Salibra, A., and G. Scollo, ‘Compactness and Löwenheim-Skolem Properties in Pre-Institution Categories’, in C.Rauszer, (ed.), Algebraic Methods in Logic and in Computer Science, vol. 28, Banach Center Publications, 1993, pp. 67–94.

  18. Salibra A., and Scollo G. (1996) ‘Interpolation and Compactness in Categories of Pre-Institutions’. Mathematical Structures in Computer Science 6(3): 261–286

    Article  Google Scholar 

  19. Sernadas A., Sernadas C., and Caleiro C. (1999) ‘Fibring of Logics as a Categorial Construction’. Journal of Logic and Computation 9(2): 149–179

    Article  Google Scholar 

  20. Tarlecki A. (1985) ‘On the Existence of Free Models in Abstract Algebraic Institutions’. Theoretical Computer Science 37(3): 269–304

    Article  Google Scholar 

  21. Tarlecki A. (1986) ‘Quasi-Varieties in Abstract Algebraic Institutions’. Journal of Computer and System Science 33(3): 269–304

    Article  Google Scholar 

  22. Tarlecki, A., Algebraic Foundations of Systems Specification, chap. Institutions: An Abstract Framework for Formal Specifications, IFIP State-of-the-Art Reports, Springer Verlag, 1999.

  23. Tarski A. (1944) ‘The Semantic Conception of Truth’. Philos. Phenomenological Research 4: 13–47

    Google Scholar 

  24. Veloso P., and Fiadeiro S., Veloso J.-L. (2002) ‘On Local Modularity and Interpolation in Entailment Systems’. Information Processing Letter 82: 203–211

    Article  Google Scholar 

  25. Veloso P., and Maibaum T. (1995) ‘On the Modularization Theorem for Logical Specifications’. Information Processing Letter, 53(5): 287–293

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBISC FRE CNRS 2873, Université d’Évry-Val d’Éssonne, 523 pl. des Terrasses, F-91000, Évry, France

    M. Aiguier

  2. IBISC FRE CNRS 2873, Université d’Évry-Val d’Éssonne, 523 pl. des Terrasses, F-91000, Évry, France

    F. Barbier

Authors
  1. M. Aiguier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Barbier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Barbier.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aiguier, M., Barbier, F. An Institution-independent Proof of the Beth Definability Theorem. Stud Logica 85, 333–359 (2007). https://doi.org/10.1007/s11225-007-9043-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-007-9043-z

Keywords

Search

Navigation