Studia Logica 50 (2):275 - 297 (1991)

We consider the notion of structural completeness with respect to arbitrary (finitary and/or infinitary) inferential rules. Our main task is to characterize structurally complete intermediate logics. We prove that the structurally complete extension of any pure implicational in termediate logic C can be given as an extension of C with a certain family of schematically denned infinitary rules; the same rules are used for each C. The cardinality of the family is continuum and, in the case of (the pure implicational fragment of) intuitionistic logic, the family cannot be reduced to a countable one. It means that the structurally complete extension of the intuitionistic logic is not countably axiomatizable by schematic rules.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370188
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,512
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Theory of Logical Calculi: Basic Theory of Consequence Operations.Ryszard Wójcicki - 1988 - Dordrecht, Boston and London: Kluwer Academic Publishers.
Structural Completeness of the Propositional Calculus.W. A. Pogorzelski - 1975 - Journal of Symbolic Logic 40 (4):604-605.

Add more references

Citations of this work BETA

Contra-Classical Logics.Lloyd Humberstone - 2000 - Australasian Journal of Philosophy 78 (4):438 – 474.

Add more citations

Similar books and articles


Added to PP index

Total views
25 ( #458,467 of 2,520,893 )

Recent downloads (6 months)
1 ( #405,457 of 2,520,893 )

How can I increase my downloads?


My notes