Proof In Alonzo Church's and Alan Turing's Mathematical Logic: Undecidability of First-Order Logic - Couverture souple

Chimakonam, Ph.D Jonathan O

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

Synopsis

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!

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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!

Biographie de l'auteur

Jonathan O. Chimakonam holds B.A. (Hons) EBSU, M.A. and Ph.D. (CAL) degrees in philosophy and specializes in mathematical logic, History of Logic (ancient and Modern) and philosophy of mathematics. He is a consultant on African studies and thought system specifically, on African psycho-logics, psychographics and psychodynamics. He has years of active experience on research on African culture, people, logic and science. He is a member of many research organizations including International Research and Development Institute, the Nigerian Philosophical Association and the Prestigious New York Academy of Sciences. Dr. Jonathan hails from Oba, Anambra State but lives in the serene city of Calabar, South-South Nigeria and teaches philosophy and logic as well as history and philosophy of science at the University of Calabar, Nigeria.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Autres éditions populaires du même titre

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

Edition présentée

ISBN 10 :  1477286691 ISBN 13 :  9781477286692
Editeur : AuthorHouse, 2012
Couverture rigide