Skip to main content

Cardinals in Isabelle/HOL

  • Conference paper
Interactive Theorem Proving (ITP 2014)

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

Included in the following conference series:

Abstract

We report on a formalization of ordinals and cardinals in Isabelle/HOL. A main challenge we faced is the inability of higher-order logic to represent ordinals canonically, as transitive sets (as done in set theory). We resolved this into a “decentralized” representation that identifies ordinals with wellorders, with all concepts and results proved to be invariant under order isomorphism. We also discuss two applications of this general theory in formal developments.

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. Bauer, G., Wenzel, M.: Calculational reasoning revisited (An Isabelle/Isar experience). In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 75–90. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Breitner, J.: Free groups. In: Klein, G., Nipkow, T., Paulson, L. (eds.) Archive of Formal Proofs (2011), http://afp.sf.net/entries/Free-Groups.shtml

  3. Church, A.: A formulation of the simple theory of types. J. Symb. Logic 5(2), 56–68 (1940)

    Article  MathSciNet  Google Scholar 

  4. Forster, T.E.: Reasoning about Theoretical Entities. World Scientific (2003)

    Google Scholar 

  5. Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press (1993)

    Google Scholar 

  6. Haftmann, F., Wenzel, M.: Constructive type classes in Isabelle. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 160–174. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Harrison, J.: The HOL wellorder library (1992), http://www.cl.cam.ac.uk/~jrh13/papers/wellorder-library.html

  8. Harrison, J.: Formalizing basic first order model theory. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 153–170. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. The HOL Light theorem prover (2014), http://www.cl.cam.ac.uk/~jrh13/hol-light/index.html

  10. Holz, M., Steffens, K., Weitz, E.: Introduction to Cardinal Arithmetic. Birkhäuser Advanced Texts. Birkhäuser (1999)

    Google Scholar 

  11. Huffman, B.: Countable ordinals. In: Klein, G., Nipkow, T., Paulson, L. (eds.) Archive of Formal Proofs (2005), http://afp.sf.net/entries/Ordinal.shtml

  12. Huffman, B., Urban, C.: Proof pearl: A new foundation for Nominal Isabelle. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 35–50. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Nipkow, T., Klein, G.: Concrete Semantics: A Proof Assistant Approach. Springer (to appear), http://www.in.tum.de/~nipkow/Concrete-Semantics

  14. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  15. Norrish, M., Huffman, B.: Ordinals in HOL: Transfinite arithmetic up to (and beyond) ω 1. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 133–146. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Schulz, S., Ternovska, E. (eds.) IWIL 2010. EPiC Series, vol. 2, pp. 1–11. EasyChair (2012)

    Google Scholar 

  17. Paulson, L.C., Grabczewski, K.: Mechanizing set theory. J. Autom. Reasoning 17(3), 291–323 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165–193 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. Popescu, A.: Ordinals and cardinals in HOL. In: Klein, G., Nipkow, T., Paulson, L. (eds.) Archive of Formal Proofs (2009), http://afp.sf.net/entries/Ordinals_and_Cardinals.shtml

  20. Popescu, A.: Contributions to the theory of syntax with bindings and to process algebra. Ph.D. thesis, University of Illinois at Urbana-Champaign (2010)

    Google Scholar 

  21. Popescu, A., Gunter, E.L.: Recursion principles for syntax with bindings and substitution. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) ICFP 2011, pp. 346–358. ACM (2011)

    Google Scholar 

  22. Popescu, A., Gunter, E.L., Osborn, C.J.: Strong normalization of System F by HOAS on top of FOAS. In: LICS 2010, pp. 31–40. IEEE (2010)

    Google Scholar 

  23. Taylor, P.: Intuitionistic sets and ordinals. J. Symb. Log. 61(3), 705–744 (1996)

    Article  MATH  Google Scholar 

  24. Traytel, D., Popescu, A., Blanchette, J.C.: Foundational, compositional (co)datatypes for higher-order logic: Category theory applied to theorem proving. In: LICS 2012, pp. 596–605. IEEE (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Blanchette, J.C., Popescu, A., Traytel, D. (2014). Cardinals in Isabelle/HOL. In: Klein, G., Gamboa, R. (eds) Interactive Theorem Proving. ITP 2014. Lecture Notes in Computer Science, vol 8558. Springer, Cham. https://doi.org/10.1007/978-3-319-08970-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08970-6_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08969-0

  • Online ISBN: 978-3-319-08970-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics