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.
Similar content being viewed by others
References
Akama, S., Constructive predicate logic with strong negation and model theory. Notre Dame Journal of Formal Logic 28, 18–27, 1988.
Akama, S., On the proof method for constructive falsity, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34, 385–392, 1988.
Akama, S., The Gentzen calculus vs. Kripke models for intuitionistic logic, submitted for publication.
Fitch, F. B., Symbolic Logic, Ronald Press, New York, 1952.
Gentzen, G., Investigations into logical deduction, The Collected Papers of Gerhard Gentzen, M. E. Szabo (ed.), 68–131, North-Holland, Amsterdam, 1969.
Gurevich, Y., Intuitionistic logic with strong negation, Studia Logica 36, 49–59, 1977.
Ishimoto, A., Constructive propositional logics with strong negation and their completeness, unpublished, 1977.
Kleene, S. C., Introduction to Metamathematics, North-Holland, Amsterdam, 1952.
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.
Nelson, D., Constructible falsity, The Journal of Symbolic Logic 14, 16–26, 1949.
Smullyan, R. M., First-Order Logic, Springer-Verlag, Berlin, 1968.
Schütte, K., Vollständige Systeme modaler und intuitionisticher Logik, Springer-Verlag, Berlin, 1968.
Thomason, R. H., A semantical study of constructible falsity, Zeitschrift für mathematische Logik und Grundlagen der mathematik 15, 247–257.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/BF00263542