Skip to main content

On Second Order Propositional Intuitionistic Logics

  • Conference paper
  • First Online:
Book cover Philosophical Logic: Current Trends in Asia

Part of the book series: Logic in Asia: Studia Logica Library ((LIAA))

  • 179 Accesses

Abstract

We give an alternative proof of (a slightly strong form of) the completeness of two second order propositional intuitionistic logics with respect to Kripke models. One is the logic having the full comprehension axiom, and the other has the constant domain axiom in addition. We also show that, if the language does not contain disjunction as a primitive symbols, then the constant domain axiom is not needed for the completeness with respect to constant domain models. To show the completeness, we use the technique of nested sequent calculi.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Fitting, M. (2014). Nested sequents for intuitionistic logics. Notre Dame Journal of Formal Logic, 55(1), 41–61.

    Google Scholar 

  • Gabbay, D. M. (1974). On 2nd order intuitionistic propositional calculus with full comprehension. Archive for Mathematical Logic, 16, 177–186.

    Article  Google Scholar 

  • Kashima, R. (2016). Completeness of second order propositional intuitionistic logics. Technical report, Tokyo Institute of Technology, from http://www.is.titech.ac.jp/~kashima/pub/C284.pdf.

  • Okada, M. (2002). A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science, 281, 471–498.

    Google Scholar 

  • Prawitz, D. (1970). Some results for intuitionistic logic with second order quantification rules. In A. Kino, J. Myhill, & R. E. Vesley (Eds.), Intuitionism and Proof Theory, Proceedings of the Summer Conference at Buffalo N.Y. 1968 (pp. 259–269): North-Holland. chapter 17.

    Google Scholar 

  • Sobolev, S. K. (1977). The intuitionistic propositional calculus with quantifiers. Mathematical Notes, 22, 528–532. (English version of Mat. Zametki 22:69–76 (1977)).

    Article  Google Scholar 

  • Sørensen, M. H., & Urzyczyn, P. (2006). Lectures on the curry-howard isomorphism. 0: Elsevier.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ryo Kashima .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kashima, R. (2017). On Second Order Propositional Intuitionistic Logics. In: Yang, SM., Lee, K., Ono, H. (eds) Philosophical Logic: Current Trends in Asia. Logic in Asia: Studia Logica Library. Springer, Singapore. https://doi.org/10.1007/978-981-10-6355-8_9

Download citation

Publish with us

Policies and ethics