Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

Proof in Alonzo Church's and Alan Turing's Mathematical Logic: Undecidability of First-Order Logic - Paperback

$18.31 USD
$18.31 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
Proof in Alonzo Church's and Alan Turing's Mathematical Logic: Undecidability of First-Order Logic - Paperback
Proof in Alonzo Church's and Alan Turing's Mathematical Logic: Undecidability of First-Order Logic - Paperback
Proof in Alonzo Church's and Alan Turing's Mathematical Logic: Undecidability of First-Order Logic - Paperback
$18.31/ea
$0.00
$18.31/ea $0.00

Product Description

by Jonathan O. Chimakonam (Ph D) (Author)

In the year 1900 the German Mathematician David Hilbert gave a curious address in Paris, at the meeting of the 2nd International Congress of Mathematicians - he titled his address "Mathematical Problems". In it, he emphasized the importance of taking on challenging problems for maintaining the progress and development of mathematics. The problems numbered 1, 2, and 10 which concern mathematical logic and which gave birth to what is called the entscheidungsproblem or the decision problem were eventually solved though in the negative by Alonzo Church and Alan Turing in their famous Church-Turing thesis. The later Turing and Gumanski's attempts are criticized as inadequate or doubtful. So the decision problem is still unsolved in the positive. This book provides a positive solution using what the author calls the General Theory of Effectively Provable Function (GEP). Tremendous insights on computer development and evolution also come to light in this research. Obviously, this book is an audacious attempt to solve a problem that has lasted for more than a century and defied the best minds of logic's greatest era!

Number of Pages: 166
Dimensions: 0.38 x 9 x 6 IN
Publication Date: November 07, 2012
you might like