The Admissible Rules of ${{mathsf{BD}_{2}}}$ and ${mathsf{GSc}}$

Notre Dame Journal of Formal Logic 59 (3):325-353 (2018)
  Copy   BIBTEX

Abstract

The Visser rules form a basis of admissibility for the intuitionistic propositional calculus. We show how one can characterize the existence of covers in certain models by means of formulae. Through this characterization, we provide a new proof of the admissibility of a weak form of the Visser rules. Finally, we use this observation, coupled with a description of a generalization of the disjunction property, to provide a basis of admissibility for the intermediate logics BD2 and GSc.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Intermediate Logics and Visser's Rules.Rosalie Iemhoff - 2005 - Notre Dame Journal of Formal Logic 46 (1):65-81.
On the rules of intermediate logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
An Abelian Rule for BCI—and Variations.Tomasz Kowalski & Lloyd Humberstone - 2016 - Notre Dame Journal of Formal Logic 57 (4):551-568.
Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
Metalogic of Intuitionistic Propositional Calculus.Alex Citkin - 2010 - Notre Dame Journal of Formal Logic 51 (4):485-502.
Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
Rules and Arithmetics.Albert Visser - 1999 - Notre Dame Journal of Formal Logic 40 (1):116-140.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
A(nother) characterization of intuitionistic propositional logic.Rosalie Iemhoff - 2001 - Annals of Pure and Applied Logic 113 (1-3):161-173.

Analytics

Added to PP
2017-08-02

Downloads
19 (#775,535)

6 months
11 (#226,803)

Historical graph of downloads
How can I increase my downloads?

References found in this work

A propositional calculus with denumerable matrix.Michael Dummett - 1959 - Journal of Symbolic Logic 24 (2):97-106.
Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.

View all 38 references / Add more references