Subformula semantics for strong negation systems

Journal of Philosophical Logic 19 (2):217 - 226 (1990)
  Copy   BIBTEX

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,636

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
56 (#387,061)

6 months
10 (#422,339)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On the Proof Method for Constructive Falsity.Seiki Akama - 1988 - Mathematical Logic Quarterly 34 (5):385-392.
On the Proof Method for Constructive Falsity.Seiki Akama - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (5):385-392.

Add more references