Subformula semantics for strong negation systems

Journal of Philosophical Logic 19 (2):217 - 226 (1990)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00263542
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,954
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles


Added to PP index

Total downloads
25 ( #254,159 of 2,293,884 )

Recent downloads (6 months)
2 ( #254,453 of 2,293,884 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature