Skip to main content

Abstract

We discuss human and mechanized reasoning with regards to the use of proof assistants, in particular Isabelle/HOL. We use the development of novel NAND- and NOR-based micro provers as a case study. Current, widely available automated reasoning technology is suitable for assisting humans with certain types of reasoning, like finding proofs for well-defined theorems. Other types of reasoning, like the discovery of new theorems, are notoriously difficult for mechanized reasoning. Our case study indicates that proof assistants are well suited as development tools for assuredly correct programs in languages like Haskell.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Beckert, B., Posegga, J.: leanTaP: lean tableau-based deduction. J. Autom. Reason. 15(3), 339–358 (1995)

    Article  Google Scholar 

  2. Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability. IOS press, Amsterdam (2009)

    Google Scholar 

  3. Blanchette, J.C.: Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk). In: Mahboubi, A., Myreen, M.O. (eds.) Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2019, pp. 1–13. ACM (2019)

    Google Scholar 

  4. Fitting, M.: leanTAP revisited. J. Log. Comput. 8(1), 33–47 (1998)

    Article  MathSciNet  Google Scholar 

  5. Kalish, D., Montague, R., Mar, G.: Logic: Techniques of Formal Reasoning (Second edn.). Oxford University Press, Oxford (1980)

    Google Scholar 

  6. Klein, G., et al.: SeL4: formal verification of an operating-system kernel. Commun. ACM 53(6), 107–115 (2010)

    Article  Google Scholar 

  7. Livingston, E.: Ethnographies of Reason. Directions in Ethnomethodology and Conversation Analysis. Ashgate, Farnham, UK (2008)

    Google Scholar 

  8. Makridis, O.: The Sheffer Stroke. The Internet Encyclopedia of Philosophy (2021). https://iep.utm.edu/sheffers

  9. Michaelis, J., Nipkow, T.: Formalized proof systems for propositional logic. In: Abel, A., Forsberg, F.N., Kaposi, A. (eds.) 23rd International Conference on Types for Proofs and Programs (TYPES 2017), LIPIcs, vol. 104, pp. 6:1–6:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

    Google Scholar 

  10. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science, vol. 2283. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  11. Raayoni, G., et al.: Generating conjectures on fundamental constants with the Ramanujan machine. Nature 590, 67–73 (2021)

    Article  Google Scholar 

  12. Ridge, T., Margetson, J.: A mechanically verified, sound and complete theorem prover for first order logic. In: Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK,22–25 August 2005, Proceedings, pp. 294–309 (2005)

    Google Scholar 

  13. Shankar, N.: Towards mechanical metamathematics. J. Autom. Reason. 1(4), 407–434 (1985)

    Article  MathSciNet  Google Scholar 

  14. Villadsen, J.: Tautology checkers in Isabelle and Haskell. In: Calimeri, F., Perri, S., Zumpano, E. (eds.) Proceedings of the 35th Italian Conference on Computational Logic - CILC 2020, Rende, Italy, 13–15 October 2020, CEUR Workshop Proceedings, vol. 2710, pp. 327–341. CEUR-WS.org (2020)

    Google Scholar 

  15. Villadsen, J., Schlichtkrull, A., From, A.H.: A verified simple prover for first-order logic. In: Konev, B., Urban, J., Rümmer, P. (eds.) Proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning co-located with Federated Logic Conference 2018 (FLoC 2018), Oxford, UK, 19th July 2018, CEUR Workshop Proceedings, vol. 2162, pp. 88–104. CEUR-WS.org (2018)

    Google Scholar 

  16. Zach, R.: Completeness before Post: Bernays, Hilbert, and the development of propositional logic. Bull. Symb. Log. 5(3), 331–366 (1999)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jørgen Villadsen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

From, A.H., Lund, S.T., Villadsen, J. (2022). A Case Study in Computer-Assisted Meta-reasoning. In: González, S.R., et al. Distributed Computing and Artificial Intelligence, Volume 2: Special Sessions 18th International Conference. DCAI 2021. Lecture Notes in Networks and Systems, vol 332. Springer, Cham. https://doi.org/10.1007/978-3-030-86887-1_5

Download citation

Publish with us

Policies and ethics