Skip to main content
Log in

Subformula semantics for strong negation systems

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

We present a semantics for strong negation systems on the basis of the subformula property of the sequent calculus. The new models, called subformula models, are constructed as a special class of canonical Kripke models for providing the way from the cut-elimination theorem to model-theoretic results. This semantics is more intuitive than the standard Kripke semantics for strong negation systems.

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

Access this article

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. Akama, S., Constructive predicate logic with strong negation and model theory. Notre Dame Journal of Formal Logic 28, 18–27, 1988.

    Google Scholar 

  2. Akama, S., On the proof method for constructive falsity, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34, 385–392, 1988.

    Google Scholar 

  3. Akama, S., The Gentzen calculus vs. Kripke models for intuitionistic logic, submitted for publication.

  4. Fitch, F. B., Symbolic Logic, Ronald Press, New York, 1952.

    Google Scholar 

  5. Gentzen, G., Investigations into logical deduction, The Collected Papers of Gerhard Gentzen, M. E. Szabo (ed.), 68–131, North-Holland, Amsterdam, 1969.

    Google Scholar 

  6. Gurevich, Y., Intuitionistic logic with strong negation, Studia Logica 36, 49–59, 1977.

    Google Scholar 

  7. Ishimoto, A., Constructive propositional logics with strong negation and their completeness, unpublished, 1977.

  8. Kleene, S. C., Introduction to Metamathematics, North-Holland, Amsterdam, 1952.

    Google Scholar 

  9. Kripke, S. A., Semantical analysis of intuitionistic logic 1, Crossley, J. and Dummett, M. (eds.), Formal Systems and Recursive Functions, 92–129, North-Holland, Amsterdam, 1965.

    Google Scholar 

  10. Nelson, D., Constructible falsity, The Journal of Symbolic Logic 14, 16–26, 1949.

    Google Scholar 

  11. Smullyan, R. M., First-Order Logic, Springer-Verlag, Berlin, 1968.

    Google Scholar 

  12. Schütte, K., Vollständige Systeme modaler und intuitionisticher Logik, Springer-Verlag, Berlin, 1968.

    Google Scholar 

  13. Thomason, R. H., A semantical study of constructible falsity, Zeitschrift für mathematische Logik und Grundlagen der mathematik 15, 247–257.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akama, S. Subformula semantics for strong negation systems. J Philos Logic 19, 217–226 (1990). https://doi.org/10.1007/BF00263542

Download citation

  • Issue Date:

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

Keywords

Navigation