Skip to main content

Self-referentiality in the Brouwer–Heyting–Kolmogorov Semantics of Intuitionistic Logic

  • Conference paper
Logical Foundations of Computer Science (LFCS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7734))

Included in the following conference series:

Abstract

The intended provability semantics of Intuitionistic Propositional Logic IPC (also called Brouwer–Heyting–Kolmogorov semantics) has been formalized within Gödel-Artemov’s framework. According to this approach, IPC is embedded in modal logic S4 by Gödel embedding and S4 is realized in Artemov’s Logic of Proofs LP which has a provability interpretation in Peano Arithmetic. Artemov’s realization of S4 in LP uses self-referential LP-formulas of the form \(t\!\!:\!\!\phi(t)\), namely, ‘t is a proof of a formula φ containing t itself.’ Kuznets showed that this is not avoidable by offering S4-theorems that cannot be realized without using self-referential LP-formulas. This paper extends Kuznets’ method to find IPC-theorems that call for direct self-referentiality in LP. Roughly speaking, examples include double-negations of tautologies that are not IPC-theorems, e.g., \(\neg\neg(\neg\neg p\!\rightarrow\! p)\), and there are also examples in the purely implicational fragment IPC  → . This suggests that the Brouwer–Heyting–Kolmogorov semantics of intuitionistic logic is intrinsically self-referential.

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. Artemov, S.N.: Operational modal logic, Technical Report MSI 95-29. Cornell University (1995)

    Google Scholar 

  2. Artemov, S.N.: Explicit provability and constructive semantics. The Bulletin of Symbolic Logic 7(1), 1–36 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brezhnev, V.N., Kuznets, R.: Making knowledge explicit: How hard it is. Theoretical Computer Science 357(1-3), 23–34 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chagrov, A., Zakharyashchev, M.: Modal companions of intermediate propositional logics. Studia Logica 51, 49–82 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fitting, M.: The logic of proofs, semantically. Annals of Pure and Applied Logic 132(1), 1–25 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fitting, M.: Realizations and LP. Annals of Pure and Applied Logic 161(3), 368–387 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gödel, K.: Eine Interpretation des intuitionistischen Aussagenkalkuls. Ergebnisse Eines Mathematischen Kolloquiums 4, 39–40 (1933); English translation in: Feferman, S., et al (eds.): Kurt Gödel Collected Works, vol. 1, pp. 301–303. Oxford University Press, Clarendon Press, Oxford, New York (1986)

    Google Scholar 

  8. Kuznets, R.: Self-referential justifications in epistemic logic. Theory of Computing Systems 46(4), 636–661 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. McKinsey, J.C.C., Tarski, A.: Some theorems about the sentential calculi of Lewis and Heyting. The Journal of Symbolic Logic 13, 1–15 (1948)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mkrtychev, A.: Models for the Logic of Proofs. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 266–275. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  11. Sørensen, M.H., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Elsevier, Amsterdam (2006)

    Google Scholar 

  12. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge University Press, Cambridge (2000)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, J. (2013). Self-referentiality in the Brouwer–Heyting–Kolmogorov Semantics of Intuitionistic Logic. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2013. Lecture Notes in Computer Science, vol 7734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35722-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35722-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35721-3

  • Online ISBN: 978-3-642-35722-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics