0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (4)
  • -
Status
Brand

Showing 1 - 4 of 4 matches in All Departments

Mathesis Universalis, Computability and Proof (Hardcover, 1st ed. 2019): Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter... Mathesis Universalis, Computability and Proof (Hardcover, 1st ed. 2019)
Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster
R3,325 Discovery Miles 33 250 Ships in 10 - 15 working days

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" ("Grunde") 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.

Well-Quasi Orders in Computation, Logic, Language and Reasoning - A Unifying Concept of Proof Theory, Automata Theory, Formal... Well-Quasi Orders in Computation, Logic, Language and Reasoning - A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory (Hardcover, 1st ed. 2020)
Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
R4,716 Discovery Miles 47 160 Ships in 12 - 17 working days

This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.

Well-Quasi Orders in Computation, Logic, Language and Reasoning - A Unifying Concept of Proof Theory, Automata Theory, Formal... Well-Quasi Orders in Computation, Logic, Language and Reasoning - A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory (Paperback, 1st ed. 2020)
Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
R4,980 Discovery Miles 49 800 Ships in 10 - 15 working days

This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.

Mathesis Universalis, Computability and Proof (Paperback, 1st ed. 2019): Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter... Mathesis Universalis, Computability and Proof (Paperback, 1st ed. 2019)
Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster
R3,294 Discovery Miles 32 940 Ships in 10 - 15 working days

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" ("Grunde") 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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Frankenstein - A Retelling
Tanya Landman Paperback R240 R192 Discovery Miles 1 920
Spel
Annerle Barnard Paperback R225 R194 Discovery Miles 1 940
Prism
J Leigh Bralick Paperback R610 Discovery Miles 6 100
Vampire Academy: The Complete Collection…
Richelle Mead Paperback R2,283 R1,762 Discovery Miles 17 620
Ouma Hester En Die Getaway-Kar
Janie Oosthuysen Paperback R170 R146 Discovery Miles 1 460
The Mark
Edyth Bulbring Paperback R255 R219 Discovery Miles 2 190
The Half Life of Love
Brianna Bourne Paperback R209 Discovery Miles 2 090
Spaceboy
David Walliams Paperback R464 Discovery Miles 4 640
Project Wormhole
Ken Preston Paperback R297 R277 Discovery Miles 2 770
The Kill Order
James Dashner Paperback  (1)
R284 R205 Discovery Miles 2 050

 

Partners