BCK is not Structurally Complete

Notre Dame Journal of Formal Logic 55 (2):197-204 (2014)
  Copy   BIBTEX

Abstract

We exhibit a simple inference rule, which is admissible but not derivable in BCK, proving that BCK is not structurally complete. The argument is proof-theoretical

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,141

External links

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

Through your library

Analytics

Added to PP
2014-04-24

Downloads
24 (#769,396)

6 months
4 (#1,172,710)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Tomasz Kowalski
La Trobe University

Citations of this work

Almost structural completeness; an algebraic approach.Wojciech Dzik & Michał M. Stronkowski - 2016 - Annals of Pure and Applied Logic 167 (7):525-556.
An Abelian Rule for BCI—and Variations.Tomasz Kowalski & Lloyd Humberstone - 2016 - Notre Dame Journal of Formal Logic 57 (4):551-568.

Add more citations

References found in this work

Structural Completeness in Fuzzy Logics.Petr Cintula & George Metcalfe - 2009 - Notre Dame Journal of Formal Logic 50 (2):153-182.
Self-implications in BCI.Tomasz Kowalski - 2008 - Notre Dame Journal of Formal Logic 49 (3):295-305.
Structural Completeness of the Propositional Calculus.W. A. Pogorzelski - 1975 - Journal of Symbolic Logic 40 (4):604-605.

Add more references