Skip to main content
SpringerLink
Log in

On the rules of intermediate logics

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate logics for which not all of the Visser rules are admissible is not known. In this paper we give a brief overview of results on admissible rules in the context of intermediate logics. We apply these results to some well-known intermediate logics. We provide natural examples of logics for which the Visser rule are derivable, admissible but nonderivable, or not admissible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Article Open access 05 May 2015

Rosalie Iemhoff

References

  1. Baaz, M., Ciabattoni, A., Fermüller, C.F.: Hypersequent Calculi for Gödel Logics-a Survey. J. Logic Comput. To appear

  2. Blackburn, P., Rijke, de M., Venema, Y.: Modal Logic. Cambridge University Press, 2001

  3. Chagrov, A., Zakharyaschev, M., Modal Logic. Oxford University Press, 1998

  4. Dummett, M.: A propositional logic with denumerable matrix. J. Symbolic Logic 24, 96–107 (1959)

    MathSciNet  Google Scholar 

  5. Fiorentini, C.: Kripke Completeness for Intermediate Logics. PhD-thesis, University of Milan, 2000

  6. Gabbay, D., de Jongh, D.: A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property. J. Symbolic Logic 39, 67–78 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ghilardi, S.: Unification in intuitionistic logic. J. Symbolic Logic 64, 859–880 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ghilardi, S.: A resolution/tableaux algorithm for projective approximations in IPC. Logic J. IGPL. 10, 229–243 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gödel, K.: Über unabhängigkeitsbeweise im Aussagenkalkül. Ergebnisse eines mathematischen Kolloquiums 4, 9–10 (1933)

    MATH  Google Scholar 

  10. Harrop, R.: Concerning formulas of the types in intuitionistic formal systems. J. Symbolic Logic 25, 27–32 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  11. Iemhoff, R.: Provability logic and admissible rules. PhD thesis, University of Amsterdam, 2001

  12. Iemhoff, R.: A(nother) characterization of Intuitionistic Propositional Logic. Ann. Pure Appl. Logic 113, 161–173 (2001)

    Article  MathSciNet  Google Scholar 

  13. Iemhoff, R.: Towards a proof system for admissibility. Computer Science Logic '03. LNCS vol. 2803, Springer, 2003, pp. 255–270

  14. Iemhoff, R.: Intermediate logics and Visser's rules. Notre Dame J. Formal Logic 46 (1), (2005)

  15. Kreisel, G., Putnam, H.: Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül. Archiv für mathematische Logic und Grundlagenforschung 3, 74–78 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  16. Medvedev, Ju.T.: Finite problems. Soc. Math. Dokl. 3, 227–230 (1962)

    MATH  Google Scholar 

  17. Minari, P., Wronski, A.: The property (HD) in intermediate logics. Rep. Math. Logic 22, 21–25 (1988)

    MATH  MathSciNet  Google Scholar 

  18. Nishinura, I.: On formulas of one propositional variable in intuitionistic propositional calculus. J. Symbolic Logic 25 (4), 327–331 (1960)

    Google Scholar 

  19. van Oosten, J.: Realizability and independence of premise. Technical report, University Utrecht, 2004

  20. Prucnal, H.: On two problems of Harvey Friedman. Studia Logica 38, 257–262 (1979)

    Article  MathSciNet  Google Scholar 

  21. Rose, G.F.: Propositional calculus and realizability. Trans. Am. Math. Soc. 75, 1–19 (1953)

    Article  MATH  Google Scholar 

  22. Roziere, P.: Regles Admissibles en calcul propositionnel intuitionniste. PhD-thesis (in french), Université Paris VII, 1992

  23. Rybakov, V.V.: A Criterion for Admissibility of Rules in the Modal System S4 and the Intuitionistic Logic. Algebra and logic 23 (5), 369–384 (1984)

    Article  Google Scholar 

  24. Rybakov, V.V.: Admissibility of Logical Inference Rules. Elsevier, 1997

  25. Smoryński, C.: Applications of Kripke Models. Mathematical Investigations of Intuitionistic Arithmetic and Analysis, Springer, 1973

  26. Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics, vol. I, North-Holland, 1988

  27. Visser, A.: Substitutions of Σ-sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic. Ann. Pure Appl. Logic 114 (1–3), 227–271 (2002)

    Google Scholar 

  28. Visser, A.: Rules and Arithmetics. Notre Dame J. Formal Logic 40 (1), 116–140 (1999)

    MathSciNet  Google Scholar 

  29. Wronski, A.: Remarks on intermediate logics with axiomatizations containing only one variable. Reports on Mathematical Logic 2, 63–75 (1974)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Discrete Mathematics and Geometry E104, Vienna University of Technology, Wiedner Hauptstrasse 8-10, 1040, Vienna, Austria

    Rosalie Iemhoff

Authors
  1. Rosalie Iemhoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rosalie Iemhoff.

Additional information

Supported by the Austrian Science Fund FWF under projects P16264 and P16539.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iemhoff, R. On the rules of intermediate logics. Arch. Math. Logic 45, 581–599 (2006). https://doi.org/10.1007/s00153-006-0320-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-006-0320-8

Mathematics Subject Classification (2000)

Keywords or phrases

Search

Navigation