𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Mathesis Universalis, Computability and Proof

✍ Scribed by Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster


Publisher
Springer International Publishing
Year
2019
Tongue
English
Leaves
375
Series
Synthese Library 412
Edition
1st ed. 2019
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


In a fragment entitled Elementa Nova Matheseos Universalis (1683?) Leibniz writes β€œthe mathesis […]shall deliver the method through which things that are conceivable can be exactly determined”; in another fragment he takes the mathesis to be β€œthe science of all things that are conceivable.” Leibniz considers all mathematical disciplines as branches of the mathesis and conceives the mathesis as a general science of forms applicable not only to magnitudes but to every object that exists in our imagination, i.e. that is possible at least in principle. As a general science of forms the mathesis investigates possible relations between β€œarbitrary objects” (β€œobjets quelconques”). It is an abstract theory of combinations and relations among objects whatsoever.

In 1810 the mathematician and philosopher Bernard Bolzano published a booklet entitled Contributions to a Better-Grounded Presentation of Mathematics. There is, according to him, a certain objective connection among the truths that are germane to a certain homogeneous field of objects: some truths are the β€œreasons” (β€œGrΓΌnde”) of others, and the latter are β€œconsequences” (β€œFolgen”) of the former. The reason-consequence relation seems to be the counterpart of causality at the level of a relation between true propositions. Arigorous proof is characterized in this context as a proof that shows the reason of the proposition that is to be proven. Requirements imposed on rigorous proofs seem to anticipate normalization results in current proof theory.

The contributors of Mathesis Universalis, Computability and Proof, leading experts in the fields of computer science, mathematics, logic and philosophy, show the evolution of these and related ideas exploring topics in proof theory, computability theory, intuitionistic logic, constructivism and reverse mathematics, delving deeply into a contextual examination of the relationship between mathematical rigor and demands for simplification.

✦ Table of Contents


Front Matter ....Pages i-x
Introduction: Mathesis Universalis, Proof and Computation (Stefania Centrone)....Pages 1-6
Diplomacy of Trust in the European Crisis: Contributions by the Alexander von Humboldt Foundation (Enno Aufderheide)....Pages 7-11
Mathesis Universalis and Homotopy Type Theory (Steve Awodey)....Pages 13-36
Note on the Benefit of Proof Representations by Name (Matthias Baaz)....Pages 37-45
Constructive Proofs of Negated Statements (Josef Berger, Gregor Svindland)....Pages 47-53
On the Constructive and Computational Content of Abstract Mathematics (Ulrich Berger)....Pages 55-73
Addressing Circular Definitions via Systems of Proofs (Riccardo Bruni)....Pages 75-100
The Monotone Completeness Theorem in Constructive Reverse Mathematics (Hajime Ishihara, Takako Nemoto)....Pages 101-112
From Mathesis Universalis to Fixed Points and Related Set-Theoretic Concepts (Gerhard JΓ€ger, Silvia Steila)....Pages 113-129
Through an Inference Rule, Darkly (Roman Kuznets)....Pages 131-158
Objectivity and Truth in Mathematics: A Sober Non-platonist Perspective (Godehard Link)....Pages 159-202
From Mathesis Universalis to Provability, Computability, and Constructivity (Klaus Mainzer)....Pages 203-234
Analytic Equational Proof Systems for Combinatory Logic and Ξ»-Calculus:A Survey (Pierluigi Minari)....Pages 235-253
Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Thomas Powell)....Pages 255-290
The Concepts of Proof and Ground (Dag Prawitz)....Pages 291-309
On Relating Theories: Proof-Theoretical Reduction (Michael Rathjen, Michael Toppel)....Pages 311-331
Program Extraction from Proofs: The Fan Theorem for Uniformly Coconvex Bars (Helmut Schwichtenberg)....Pages 333-341
Counting and Numbers, from Pure Mathesis to Base Conversion Algorithms (Jan von Plato)....Pages 343-351
Point-Free Spectra of Linear Spreads (Daniel Wessel)....Pages 353-374

✦ Subjects


Philosophy; Logic; Mathematical Logic and Foundations; Mathematical Logic and Formal Languages


πŸ“œ SIMILAR VOLUMES


Proofs and Computations
✍ Helmut Schwichtenberg, Stanley S. Wainer πŸ“‚ Library πŸ“… 2012 πŸ› Cambridge University Press 🌐 English

Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I cover

Proof and Computation
✍ Ulrich Berger, Helmut Schwichtenberg (auth.), Helmut Schwichtenberg (eds.) πŸ“‚ Library πŸ“… 1995 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>Logical concepts and methods are of growing importance in many areas of computer science. The proofs-as-programs paradigm and the wide acceptance of Prolog show this clearly. The logical notion of a formal proof in various constructive systems can be viewed as a very explicit way to describe a co

Proofs and Computations
✍ Helmut Schwichtenberg, Stanley S. Wainer πŸ“‚ Library πŸ“… 2012 πŸ› Cambridge University Press 🌐 English
Proofs and Computations
✍ Helmut Schwichtenberg, Stanley S. Wainer πŸ“‚ Library πŸ“… 2012 πŸ› Cambridge University Press 🌐 English