Deduction, computation, experiment : exploring the effectiveness of proof
著者
書誌事項
Deduction, computation, experiment : exploring the effectiveness of proof
Springer, c2008
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Includes bibliographical references and index
内容説明・目次
内容説明
This volume is located in a cross-disciplinary ?eld bringing together mat- matics, logic, natural science and philosophy. Re?ection on the e?ectiveness of proof brings out a number of questions that have always been latent in the informal understanding of the subject. What makes a symbolic constr- tion signi?cant? What makes an assumption reasonable? What makes a proof reliable? G odel, Church and Turing, in di?erent ways, achieve a deep und- standing of the notion of e?ective calculability involved in the nature of proof. Turing's work in particular provides a "precise and unquestionably adequate" de?nition of the general notion of a formal system in terms of a machine with a ?nite number of parts. On the other hand, Eugene Wigner refers to the - reasonable e?ectiveness of mathematics in the natural sciences as a miracle. Where should the boundary be traced between mathematical procedures and physical processes? What is the characteristic use of a proof as a com- tation, as opposed to its use as an experiment? What does natural science tell us about the e?ectiveness of proof? What is the role of mathematical proofs in the discovery and validation of empirical theories? The papers collected in this book are intended to search for some answers, to discuss conceptual and logical issues underlying such questions and, perhaps, to call attention to other relevant questions.
目次
Why Proof? What is a Proof?.- On Formal Proofs.- Toy Models in Physics and the Reasonable Effectiveness of Mathematics.- Experimental Methods in Proofs.- Proofs Verifying Programs and Programs Producing Proofs: A Conceptual Analysis.- The Logic of the Weak Excluded Middle: A Case Study of Proof-Search.- Automated Search for Goedel's Proofs.- Proofs as Efficient Programs.- Quantum Combing.- Proofs instead of Meaning Explanations: Understanding Classical vs Intuitionistic Mathematics from the Outside.- Proof as a Path of Light.- Computability and Incomputability of Differential Equations.- Phenomenology of Incompleteness: From Formal Deductions to Mathematics and Physics.
「Nielsen BookData」 より