Metalogic of Intuitionistic Propositional Calculus

Notre Dame Journal of Formal Logic 51 (4):485-502 (2010)
  Copy   BIBTEX


With each superintuitionistic propositional logic L with a disjunction property we associate a set of modal logics the assertoric fragment of which is L . Each formula of these modal logics is interdeducible with a formula representing a set of rules admissible in L . The smallest of these logics contains only formulas representing derivable in L rules while the greatest one contains formulas corresponding to all admissible in L rules. The algebraic semantic for these logics is described



    Upload a copy of this work     Papers currently archived: 86,592

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

Modal logic as metalogic.Kosta Došen - 1992 - Journal of Logic, Language and Information 1 (3):173-201.
Metacompleteness of Substructural Logics.Takahiro Seki - 2012 - Studia Logica 100 (6):1175-1199.


Added to PP

36 (#367,871)

6 months
3 (#343,082)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
Concerning formulas of the types a →b ∨c, a →(ex)b(X).Ronald Harrop - 1960 - Journal of Symbolic Logic 25 (1):27-32.

View all 12 references / Add more references