中文
相关论文

相关论文: Formalising New Mathematics in Isabelle: Diagonal …

200 篇论文

This essay examines the relationship between artificial intelligence and the historical evolution of modern Mathematics. Rather than viewing AI as an external rupture, we argue that its effectiveness reveals a structural tendency already…

微分几何 · 数学 2026-05-28 Jaime Ripoll

The need for formal definition of the very basis of mathematics arose in the last century. The scale and complexity of mathematics, along with discovered paradoxes, revealed the danger of accumulating errors across theories. Although,…

计算机科学中的逻辑 · 计算机科学 2018-09-10 Artem Yushkovskiy

A logic for specification and verification is derived from the axioms of Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the…

计算机科学中的逻辑 · 计算机科学 2008-02-03 Lawrence C. Paulson

As the twin movements of open science and open source bring an ever greater share of the scientific process into the digital realm, new opportunities arise for the meta-scientific study of science itself, including of data science and…

统计理论 · 数学 2020-06-17 Evan Patterson

Mathematics formalisation is the task of writing mathematics (i.e., definitions, theorem statements, proofs) in natural language, as found in books and papers, into a formal language that can then be checked for correctness by a program. It…

计算与语言 · 计算机科学 2022-11-15 Ayush Agrawal , Siddhartha Gadgil , Navin Goyal , Ashvni Narayanan , Anand Tadipatri

Formalizing mathematical proofs using computerized verification languages like Lean 4 has the potential to significantly impact the field of mathematics, it offers prominent capabilities for advancing mathematical reasoning. However,…

计算与语言 · 计算机科学 2024-11-11 Xichen Tang

The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are suitable as technological basis for educational tools. The traditionally strong logical foundations of systems like HOL, Coq, or Isabelle have…

计算机科学中的逻辑 · 计算机科学 2012-02-23 Makarius Wenzel , Burkhart Wolff

In this paper we define new numbers called the Neo-Ramsay numbers. We show that these numbers are in fact equal to the Ramsay numbers. Neo-Ramsey numbers are easy to compute and for finding them it is not necessary to check all possible…

综合数学 · 数学 2007-05-23 Dhananjay P. Mehendale

Assurance cases are often required to certify critical systems. The use of formal methods in assurance can improve automation, increase confidence, and overcome errant reasoning. However, assurance cases can never be fully formalised, as…

软件工程 · 计算机科学 2021-06-11 Simon Foster , Yakoub Nemouchi , Mario Gleirscher , Ran Wei , Tim Kelly

Isabelle/PIDE has emerged over more than 10 years as the standard Prover IDE for interactive theorem proving in Isabelle. The well-established Archive of Formal Proofs (AFP) testifies the success of such applications of formalized…

计算机科学中的逻辑 · 计算机科学 2019-05-07 Makarius Wenzel

Regularization and Bayesian methods for system identification have been repopularized in the recent years, and proved to be competitive w.r.t. classical parametric approaches. In this paper we shall make an attempt to illustrate how the use…

系统与控制 · 计算机科学 2015-11-06 A. Chiuso

Verifying mathematical proofs is difficult, but can be automated with the assistance of a computer. Autoformalization is the task of automatically translating natural language mathematics into a formal language that can be verified by a…

计算与语言 · 计算机科学 2024-07-11 Nilay Patel , Rahul Saha , Jeffrey Flanigan

We present a formalization of higher-order logic in the Isabelle proof assistant, building directly on the foundational framework Isabelle/Pure and developed to be as small and readable as possible. It should therefore serve as a good…

计算机科学中的逻辑 · 计算机科学 2024-04-09 Simon Tobias Lund , Jørgen Villadsen

Mathematical understanding is built in many ways. Among these, illustration has been a companion and tool for research for as long as research has taken place. We use the term illustration to encompass any way one might bring a mathematical…

Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…

人工智能 · 计算机科学 2024-12-04 Xuanxiang Huang , Joao Marques-Silva

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

计算机科学中的逻辑 · 计算机科学 2014-01-14 Stefano Berardi

Recently, a growing number of researchers have applied machine learning to assist users of interactive theorem provers. However, the expressive nature of underlying logics and esoteric structures of proof documents impede machine learning…

计算机科学中的逻辑 · 计算机科学 2020-05-27 Yutaka Nagashima

Digital mathematical libraries assemble the knowledge of years of mathematical research. Numerous disciplines (e.g., physics, engineering, pure and applied mathematics) rely heavily on compendia gathered findings. Likewise, modern research…

数字图书馆 · 计算机科学 2022-06-10 André Greiner-Petter , Howard S. Cohl , Abdou Youssef , Moritz Schubotz , Avi Trost , Rajen Dey , Akiko Aizawa , Bela Gipp

The ForMaRE project applies formal mathematical reasoning to economics. We seek to increase confidence in economics' theoretical results, to aid in discovering new results, and to foster interest in formal methods, i.e. computer-aided…

计算工程、金融与科学 · 计算机科学 2013-05-21 Christoph Lange , Colin Rowat , Manfred Kerber

The purpose of this survey is to provide a gentle introduction to several recent breakthroughs in graph Ramsey theory. In particular, we will outline the proofs (due to various groups of authors) of exponential improvements to the diagonal,…

组合数学 · 数学 2026-01-09 Robert Morris