Non-Fiction Books:

Formalizing Finite Set Combinatorics in Type Theory

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
  • Formalizing Finite Set Combinatorics in Type Theory by Abhishek Kr Singh
  • Formalizing Finite Set Combinatorics in Type Theory by Abhishek Kr Singh
$89.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

Afterpay is available on orders $100 to $2000 Learn more

6 weekly interest-free payments of $14.83 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 26 Jun - 8 Jul using International Courier

Description

Mathematics can be distinguished among all the sciences due to its precise language and clear rules of reasoning. The notion of proof lies at the heart of mathematics. Typically, proof of any mathematical statement is a logical argument, that can convince anyone of the correctness of the statement. Starting with a set of assumptions a mathematical proof tries to discover new facts using a sequence of logical steps. These logical steps must correspond to the rules of reasoning which are considered correct in mathematics. Ideally, proof should contain all the necessary information so that its verification becomes a purely mechanical job. However, the contemporary practice of writing mathematical proofs is only an approximation to this ideal, where the task of a reviewer is to use his intelligence to judge whether the proof could be expressed in a way that conforms to the valid rules of reasoning. A reviewer very often comes across inferential gaps, imprecise definitions, and unstated background assumptions. In such circumstances, it is difficult to say whether a proof is correct or not. Even if the statement turns out to be true, judging it to be so could take a long time. Mathematical proofs are becoming more and more complex and the length of unusually large proofs has also increased with time. If a proof is short one can check it manually. But if proof is deep and already fills hundreds of journal pages very few people may have the expertise to go through it. The correctness concern of such complex proofs is further enhanced by the fact that some of these proofs rely on extensive computation.
Release date NZ
December 30th, 2023
Audience
  • General (US: Trade)
Pages
116
Dimensions
216x279x6
ISBN-13
9798223614104
Product ID
38523211

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...