Distilling the requirements of Gödel’s incompleteness theorems with a proof assistant

Popescu, A. orcid.org/0000-0001-8747-0619 and Traytel, D. (2021) Distilling the requirements of Gödel’s incompleteness theorems with a proof assistant. Journal of Automated Reasoning, 65 (7). pp. 1027-1070. ISSN 0168-7433

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © The Author(s) 2021. Open Access: This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Keywords: Gödel’s incompleteness theorems; abstract requirements; formal verification; proof assistant; Isabelle/HOL
Dates:
  • Accepted: 21 March 2021
  • Published (online): 28 August 2021
  • Published: October 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 01 Oct 2021 13:55
Last Modified: 01 Oct 2021 13:55
Status: Published
Publisher: Springer Science and Business Media LLC
Refereed: Yes
Identification Number: https://doi.org/10.1007/s10817-021-09599-8
Related URLs:

Share / Export

Statistics