Completeness of a logical system for structured specifications

@inproceedings{Borzyszkowski1998CompletenessOA,
  title={Completeness of a logical system for structured specifications},
  author={Tomasz Borzyszkowski},
  year={1998}
}
The main aim of this paper is to present a completeness proof of a formal system for reasoning about logical consequences of structured specifications. The system is based on the proof rules for structural specifications build in an arbitrary institution as presented in [ST 88]. The proof of its completeness is inspired by the proof due to M. V. Cengarle (see [Cen 94]) for specifications in first-order logic and the logical system for reasoning about them presented also in [Wir 91]. 

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Logical Support for Modularization

  • R. Diaconescu, J. Goguen, P. Stefaneas
  • In: G. Huet, G. Plotkin, editors Logical…
  • 1993
1 Excerpt

Towards formal development of programs from algebraic specification: parameterization revised

  • lowski, A. Tarlecki
  • Acta Informatica,
  • 1992

Structured Specifications: Syntax

  • M. Wirsing
  • Semantics and Proof Calculus. In F. L. Bauer, W…
  • 1991
1 Excerpt