Skip to main content
SpringerLink
Log in

Stability of weak second-order semantics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

By extending the underlying data structure by new elements, we also extend the intput/output relation generated by a program i.e., no existing run is killed, and no new one lying entirely in the old structure is created. We investigate this stability property for the weak second order semantics derived from nonstandard time models. It turns out that the light face, i.e., parameterless collection principle always induces stable semantics, but the bold face one may be unstable. We give an example where an elementary extension kills a ‘bold face run’ showing also that the light face semantics is strictly weaker than the bold face one.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Andréka, I. Németi and I. Sain, A complete logic for reasoning about programs via nonstandard model theory, Theoretical Computer Science 17 (1982), pp. 193–212, 259–278.

    Google Scholar 

  2. R. M. Burstall, Program proving as hand simulation with a little induction, IFIP Congress, Stockholm, (1964).

  3. C. C. Chang and H. J. Keisler, Model Theory, North-Holland, 1975.

  4. L. Csirmaz, Strong semantical characterization for nondeterministic programs, Zeischrift für Math. Logik, to appear.

  5. D. Leivant, Logical and mathematical reasoning about imperative programs, Proceedings of POPL '85.

  6. A. Makkai, A survey of basic stability theory, with particular emphasis on orthogonality and regular types, Israel Journal of Mathematics 49 (1984), pp. 181–238.

    Google Scholar 

  7. M. Makkai, personal communication.

  8. J. Makowski and I. Sain, On the equivalence of weak second order logic and nonstandard time semantics for Floyd-Hoare logic, preprint.

  9. A. Pillay, An introduction to stability theory, Oxford Logic Guides 8, Oxford University Press, 1983.

  10. I. Sain, A simple proof for the completeness of Floyd's method, Theoretical Computer Science 35 (1985), pp. 345–348.

    Google Scholar 

  11. S. Shelah, Classification Theory and the Number of Non-Isomorphic Models, North-Holland, 1978.

  12. S. Shelah, personal communication.

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary

    László Csirmaz

  2. University of Chicago, USA

    László Csirmaz

Authors
  1. László Csirmaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research was partially carried out while the author visited McGill University, Montreal, Canada, and was supported in part by the Natural and Sciences and Engineering Research Council of Canada

Rights and permissions

Reprints and permissions

About this article

Cite this article

Csirmaz, L. Stability of weak second-order semantics. Stud Logica 47, 193–202 (1988). https://doi.org/10.1007/BF00370550

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370550

Keywords

Search

Navigation