Skip to main content

Jankov’s Theorems for Intermediate Logics in the Setting of Universal Models

  • Conference paper
Logic, Language, and Computation (TbiLLC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6618))

Included in the following conference series:

Abstract

In this article we prove two well-known theorems of Jankov in a uniform frame-theoretic manner. In frame-theoretic terms, the first one states that for each finite rooted intuitionistic frame there is a formula ψ with the property that this frame can be found in any counter-model for ψ in the sense that each descriptive frame that falsifies ψ will have this frame as the p-morphic image of a generated subframe ([12]). The second one states that KC, the logic of weak excluded middle, is the strongest logic extending intuitionistic logic IPC that proves no negation-free formulas beyond IPC ([13]). The proofs use a simple frame-theoretic exposition of the fact discussed and proved in [4] that the upper part of the n-Henkin model \(\mathcal{H}(n)\) is isomorphic to the n-universal model \(\mathcal{U}(n)\) of IPC. Our methods allow us to extend the second theorem to many logics L for which L and L + KC prove the same negation-free formulas. All these results except the last one earlier occurred in a somewhat different form in [16].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bezhanishvili, G., Bezhanishvili, N.: An algebraic approach to canonical formulas: intuitionistic case. The Review of Symbolic Logic 2, 3 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bezhanishvili, G., Bezhanishvili, N., de Jongh, D.: The Kuznetsov-Gerciu and Rieger-Nishimura logics: The boundaries of the finite model property. Special Issue of Logic and Logical Philosophy Dedicated to A.V. Kuznetsov 17, 73–110 (2008)

    MathSciNet  MATH  Google Scholar 

  3. Bezhanishvili, G., Ghilardi, S.: An algebraic approach to subframe logics. intuitionistic case. Annals of Pure and Applied Logic 147, 84–100 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bezhanishvili, N.: Lattices of Intermediate and Cylindric Modal Logics. PhD thesis, University of Amsterdam, Netherlands (2006)

    Google Scholar 

  5. Bezhanishvili, N., de Jongh, D.: Projective formulas in two variables in intuitionistic propositional logic (2008) (manuscript)

    Google Scholar 

  6. Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press, Oxford (1997)

    MATH  Google Scholar 

  7. de Jongh, D.: Investigations on the Intuitionistic Propositional Calculus. PhD thesis, University of Wisconsin (1968)

    Google Scholar 

  8. de Jongh, D.: A characterization of the intuitionistic propositional calculus. In: Kino, M. (ed.) Intuitionism and Proof Theory, pp. 211–217. North-Holland, Amsterdam (1970)

    Google Scholar 

  9. de Jongh, D., Hendriks, L., Renardel de Lavalette, G.: Computations in fragments of intuitionistic propositional logic. Journal of Automated Reasoning 7(4), 537–561 (1991)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Hendriks, L.: Computations in Propositional Logic. PhD thesis, University of Amsterdam, Netherlands (1996)

    Google Scholar 

  12. Jankov, V.: The relationship between deducibility in the intuitionistic propositional calculus and finite implicational structures. Soviet Mathematics Doklady (1963)

    Google Scholar 

  13. Jankov, V.A.: Ob ischislenii slabogo zakona iskluchennogo tret’jego. Izvestija AN. SSSR, ser. matem. 32(5), 1044–1051 (1968)

    Google Scholar 

  14. Renardel de Lavalette, G., Hendriks, L., de Jongh, D.: Intuitionistic implication without disjunction. Tech. rep., Institute for Logic, Language and Computation, University of Amsterdam (2010)

    Google Scholar 

  15. Visser, A., de Jongh, D., van Benthem, J., Renardel de Lavalette, G.: NNIL, a study in intuionistic propositional logic. In: Ponse, A., de Rijke, M., Venema, Y. (eds.) Modal Logics and Process Algebra: a bisimulation perspective, pp. 289–326 (1995)

    Google Scholar 

  16. Yang, F.: Intuitionistic subframe formulas, NNIL-formulas and n-universal models. Master’s thesis, University of Amsterdam (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Jongh, D., Yang, F. (2011). Jankov’s Theorems for Intermediate Logics in the Setting of Universal Models. In: Bezhanishvili, N., Löbner, S., Schwabe, K., Spada, L. (eds) Logic, Language, and Computation. TbiLLC 2009. Lecture Notes in Computer Science(), vol 6618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22303-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22303-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22302-0

  • Online ISBN: 978-3-642-22303-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics