中文
相关论文

相关论文: Why prove things?

200 篇论文

In mathematics information is a number that measures uncertainty (entropy) based on a probabilistic distribution, often of an obscure origin. In real life language information is a datum, a statement, more precisely, a formula. But such a…

人工智能 · 计算机科学 2022-05-17 Anatol Slissenko

When talking to secondary school students, first impressions are crucial. Accidentally say something that sounds boring and you'll lose them in seconds. A physical demonstration can be an eye-catching way to begin an activity or spark off a…

物理教育 · 物理学 2016-06-14 Philip Pearce , Tom Shearer

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Formal logic has often been seen as uniquely placed to analyze mathematical argumentation. While formal logic is certainly necessary for a complete understanding of mathematical practice, it is not sufficient. Important aspects of…

历史与综述 · 数学 2024-05-06 Andrew Aberdein , Zoe Ashton

Explaining why a database query result is obtained is an essential task towards the goal of Explainable AI, especially nowadays where expressive database query languages such as Datalog play a critical role in the development of…

数据库 · 计算机科学 2023-03-23 Marco Calautti , Ester Livshits , Andreas Pieris , Markus Schneider

We introduce a novel task consisting in assigning a proof to a given mathematical statement. The task is designed to improve the processing of research-level mathematical texts. Applying Natural Language Processing (NLP) tools to research…

计算与语言 · 计算机科学 2021-02-04 Maximin Coavoux , Shay B. Cohen

Arising out of an attempt at a new foundations of mathematics, in which relations are more primitive than sets, and out of the theoretical physicists' concept of underlying causes of empirical phenomena, the idea of a purely mathematical…

物理学史与哲学 · 物理学 2011-11-22 Helier Robinson

In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.

综合数学 · 数学 2018-07-09 Bin Shen

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

代数拓扑 · 数学 2010-07-09 John R. Klein , Bruce Williams

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

历史与综述 · 数学 2015-04-23 Piotr Błaszczyk

In order to help students learn how to write mathematical proofs, we adapt the Coq proof assistant into an educational tool we call Waterproof. Like with other interactive theorem provers, students write out their proofs inside the software…

Teaching college students how to write rigorous proofs is a critical objective in courses that introduce formal reasoning. Over the course of several years, we have developed a mechanically-checkable style of calculational reasoning that we…

计算机科学中的逻辑 · 计算机科学 2023-07-25 Andrew T. Walter , Ankit Kumar , Panagiotis Manolios

Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.

综合数学 · 数学 2022-08-09 Bikash Chakraborty

As modern computing moves towards smaller devices and powerful cloud platforms, more and more computation is being delegated to powerful service providers. Interactive proofs are a widely-used model to design efficient protocols for…

计算机科学与博弈论 · 计算机科学 2018-09-14 Jing Chen , Samuel McCauley , Shikha Singh

We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…

计算机科学中的逻辑 · 计算机科学 2019-12-06 Alejandro Díaz-Caro , Gilles Dowek

The purpose of this note is to raise two different questions, which are rarely if ever considered, and to which, it seems, we lack convincing, systematic answers. These questions can be posed as: - Why do we compute? - What do we compute?…

计算机科学中的逻辑 · 计算机科学 2014-03-20 Samson Abramsky

We sketch several proofs of F\'ary--Milnor theorem.

历史与综述 · 数学 2024-02-27 Anton Petrunin , Stephan Stadler

In this paper I propose the idea to establish a clear distinction between the foundations of truth and the foundations of meaning in Mathematics. I explore on the most basic example, the mathematical line, the possibility that the…

历史与综述 · 数学 2008-12-18 Bernard Teissier

We prove Union-Closed sets conjecture.

组合数学 · 数学 2024-09-13 Vladimir Blinovsky , Llohann D Speranca

Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…

逻辑 · 数学 2010-06-17 Jeremy Avigad