Marknadens största urval
Snabb leverans

Mathesis Universalis, Computability and Proof

Om Mathesis Universalis, Computability and Proof

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.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9783030204495
  • Format:
  • Häftad
  • Sidor:
  • 374
  • Utgiven:
  • 6. november 2020
  • Utgåva:
  • 12019
  • Mått:
  • 155x235x0 mm.
  • Vikt:
  • 587 g.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 19. december 2024
Förlängd ångerrätt till 31. januari 2025

Beskrivning av Mathesis Universalis, Computability and Proof

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.

Användarnas betyg av Mathesis Universalis, Computability and Proof



Hitta liknande böcker
Boken Mathesis Universalis, Computability and Proof finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.