An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi

Mathematical Logic Quarterly 15 (16‐18):259-288 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

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

On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Sequent Calculi for Visser's Propositional Logics.Kentaro Kikuchi & Ryo Kashima - 2001 - Notre Dame Journal of Formal Logic 42 (1):1-22.
Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.

Analytics

Added to PP
2013-11-24

Downloads
10 (#1,195,881)

6 months
6 (#524,433)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Admissible Rules of ${{mathsf{BD}_{2}}}$ and ${mathsf{GSc}}$.Jeroen P. Goudsmit - 2018 - Notre Dame Journal of Formal Logic 59 (3):325-353.
Jankov‐theorems for some implicational calculi.Biswambhar Pahi - 1975 - Mathematical Logic Quarterly 21 (1):193-198.

Add more citations

References found in this work

Finite limitations on Dummet's LC.Ivo Thomas - 1962 - Notre Dame Journal of Formal Logic 3 (3):170-174.

Add more references