Mathesis universalis, computability and proof / Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster, editors.
2019
QA9.54
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Mathesis universalis, computability and proof / Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster, editors.
ISBN
9783030204471 (electronic book)
3030204472 (electronic book)
3030204464
9783030204464
3030204472 (electronic book)
3030204464
9783030204464
Publication Details
Cham : Springer, 2019.
Language
English
Description
1 online resource
Item Number
10.1007/978-3-030-20
Call Number
QA9.54
Dewey Decimal Classification
511.3/6
Summary
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. A rigorous 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.
Access Note
Access limited to authorized users.
Series
Synthese library ; v. 412.
Available in Other Form
Print version: 9783030204464
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources