Mathesis Universalis, Computability and Proof

Author:   Stefania Centrone ,  Sara Negri ,  Deniz Sarikaya ,  Peter M. Schuster
Publisher:   Springer Nature Switzerland AG
Edition:   1st ed. 2019
Volume:   412
ISBN:  

9783030204495


Pages:   374
Publication Date:   06 November 2020
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $284.60 Quantity:  
Add to Cart

Share |

Mathesis Universalis, Computability and Proof


Add your own review!

Overview

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, intuitionisticlogic, constructivism and reverse mathematics, delving deeply into a contextual examination of the relationship between mathematical rigor and demands for simplification. 

Full Product Details

Author:   Stefania Centrone ,  Sara Negri ,  Deniz Sarikaya ,  Peter M. Schuster
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   1st ed. 2019
Volume:   412
Weight:   0.587kg
ISBN:  

9783030204495


ISBN 10:   3030204499
Pages:   374
Publication Date:   06 November 2020
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1. Introduction: Mathesis Universalis, Proof and ComputationStefania Centrone 2. Diplomacy of Trust in the European CrisisEnno Aufderheide 3. Mathesis Universalis and Homotopy Type TheorySteve Awodey 4. Note on the Benefit of Proof Representations by NameMatthias Baaz 5. Constructive Proofs of Negated StatementsJosef Berger and Gregor Svindland 6. Constructivism in Abstract MathematicsUlrich Berger 7. Addressing Circular Definitions via Systems of ProofsRiccardo Bruni 8. The Monotone Completeness Theorem in Constructive Reverse MathematicsHajime Ishihara and Takako Nemoto 9. From Mathesis Universalis to Fixed Points and Related Set-Theoretic ConceptsGerhard Jäger and Silvia Steila 10. Through an Inference Rule, DarklyRoman Kuznets 11. Objectivity and Truth in Mathematics: A Sober Non-Platonist PerspectiveGodehard Link 12. From Mathesis Universalis to Provability, Computability, and ConstructivityKlaus Mainzer 13. Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus: a SurveyPierluigi Minari 14. Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful ProgramsThomas Powell 15. The Concepts of Proof and GroundDag Prawitz 16. On Relating Theories: Proof-Theoretical ReductionMichael Rathjen and Michael Toppel 17. Program Extraction from Proofs: the Fan Theorem for Uniformly Coconvex BarsHelmut Schwichtenberg 18. Counting and Numbers, from Pure Mathesis to Base Conversion AlgorithmsJan von Plato 19. Point-Free Spectra of Linear SpreadsDaniel Wessel

Reviews

 



Author Information

Stefania Centrone is currently Privatdozentin at the University of Hamburg, teaches and does research at the Universities of Oldenburg and of Helsinki and has been in 2016 deputy Professor of Theoretical Philosophy at the University of Göttingen. In 2012 she was awarded a DFG-Eigene Stelle for the project Bolzanos und Husserls Weiterentwicklung von Leibnizens Ideen zur Mathesis Universalis and 2017 a Heisenberg grant. She is author of the volumes Logic and philosophy of Mathematics in the Early Husserl (Synthese Library 2010) and Studien zu Bolzano (Academia Verlag 2015).  Sara Negri is Professor of Theoretical Philosophy at the University of Helsinki, where she has been a Docent of Logic since 1998. After a PhD in Mathematics in 1996 at the University of Padova and research visits at the University of Amsterdam and Chalmers, she has been a research associate at the Imperial College in London, a Humboldt Fellow in Munich, and a visiting scientist at the Mittag-Leffler Institute in Stockholm. Her research interests range from mathematical logic and philosophy of mathematics to proof theory and its applications to philosophical logic and formal epistemology.  Deniz Sarikaya is PhD-Student of Philosophy and studies Mathematics at the University of Hamburg with experience abroad at the Universiteit van Amsterdam and Universidad de Barcelona. He stayed a term as a Visiting Student Researcher at the University of California, Berkeley developing a project on the Philosophy of Mathematical Practice concerning the Philosophical impact of the usage of automatic theorem prover and as a RISE research intern at the University of British Columbia. He is mainly focusing on philosophy of mathematics and logic.  Peter Schuster is Associate Professor for Mathematical Logic at the University of Verona. After both doctorate and habilitation in mathematics at the University of Munich he was Lecturer at the University of Leeds and member of the Leeds Logic Group. Apart from constructive mathematics at large, his principal research interests are about the computational content of classical proofs in abstract algebra and related fields in which maximum or minimum principles are invoked.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List