{"product_id":"mathesis-universalis-computability-and-proof-von-undefined","title":"Mathesis Universalis, Computability and Proof","description":"\n                                \n                \u003cp\u003e\n                                        In a fragment entitled \n                    \n                    \u003ci\u003eElementa Nova Matheseos Universalis \u003c\/i\u003e\n                                        (1683?) Leibniz writes “the \n                    \n                    \u003ci\u003emathesis \u003c\/i\u003e\n                                        […]\n                    \n                    \u003ci\u003e \u003c\/i\u003e\n                                        shall deliver the method through which things that are conceivable can be exactly determined”; in another fragment he takes the \n                    \n                    \u003ci\u003emathesis \u003c\/i\u003e\n                                        to be “the science of all things that are conceivable.” Leibniz considers all mathematical disciplines as branches of the \n                    \n                    \u003ci\u003emathesis \u003c\/i\u003e\n                                        and conceives the \n                    \n                    \u003ci\u003emathesis \u003c\/i\u003e\n                                        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 \n                    \n                    \u003ci\u003emathesis \u003c\/i\u003e\n                                        investigates possible relations between “arbitrary objects” (“\n                    \n                    \u003ci\u003eobjets quelconques\u003c\/i\u003e\n                                        ”). It is an abstract theory of combinations and relations among objects whatsoever.\n                \n                \u003c\/p\u003e\n                                \n                \u003cp\u003e\n                                        In 1810 the mathematician and philosopher Bernard Bolzano published a booklet entitled \n                    \n                    \u003ci\u003eContributions to a Better-Grounded Presentation of Mathematics. \u003c\/i\u003e\n                                        There is, according to him, a \n                    \n                    \u003ci\u003ecertain objective connection \u003c\/i\u003e\n                                        among the truths that are germane to a certain homogeneous field of objects: some truths are the “reasons” (“\n                    \n                    \u003ci\u003eGründe\u003c\/i\u003e\n                                        ”) 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\n                    \n                    \u003ci\u003erigorous proof\u003c\/i\u003e\n                                         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.\n                \n                \u003c\/p\u003e\n                                \n                \u003cp\u003e\n                                        The contributors of \n                    \n                    \u003cb\u003eMathesis Universalis, Computability and Proof\u003c\/b\u003e\n                                        ,  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. \n                \n                \u003c\/p\u003e\n                            \n            \u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783030204495\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783030204464\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783030204495","offer_id":39424024707165,"sku":"9783030204495","price":128.39,"currency_code":"EUR","in_stock":true},{"title":"Hardcover - 9783030204464","offer_id":39522087632989,"sku":"9783030204464","price":128.39,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/28bc3bcf-2330-4fa4-a973-945eb01dcca9.jpg?v=1775621641","url":"https:\/\/shop.autorenwelt.de\/products\/mathesis-universalis-computability-and-proof-von-undefined","provider":"Autorenwelt Shop","version":"1.0","type":"link"}