Completeness Results for Fibred Parchments

  • C. Caleiro
  • P. Gouveia
  • J. Ramos
Conference paper

DOI: 10.1007/978-3-540-40020-2_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2755)
Cite this paper as:
Caleiro C., Gouveia P., Ramos J. (2003) Completeness Results for Fibred Parchments. In: Wirsing M., Pattinson D., Hennicker R. (eds) Recent Trends in Algebraic Development Techniques. WADT 2002. Lecture Notes in Computer Science, vol 2755. Springer, Berlin, Heidelberg

Abstract

In [6] it was shown that fibring could be used to combine institutions presented as c-parchments, and several completeness preservation results were established. However, their scope of applicability was limited to propositional-based logics. Herein, we extend these results to a broader class of logics, possibly including variables, terms and quantifiers. On the way, we need to consider an enriched notion of proof-calculus that deals explicitly with the substitution provisos that often appear in schematic inference rules. For illustration of the concepts, constructions and results, we shall adopt modal first-order logic as a working example.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • C. Caleiro
    • 1
  • P. Gouveia
    • 1
  • J. Ramos
    • 1
  1. 1.CLC – Departamento de MatemáticaIST – UTLLisboaPortugal

Personalised recommendations