F.D. Kamareddine – författare
Visar alla böcker från författaren F.D. Kamareddine. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Del 28 - Applied Logic Series
Thirty Five Years of Automating Mathematics
Inbunden, Engelska, 2003
1 108 kr
Skickas inom 10-15 vardagar
THIRTY FIVE YEARS OF AUTOMATING MATHEMATICS: DEDICATED TO 35 YEARS OF DE BRUIJN'S AUTOMATH N. G. de Bruijn was a well established mathematician before deciding in 1967 at the age of 49 to work on a new direction related to Automating Mathematics. By then, his contributions in mathematics were numerous and extremely influential. His book on advanced asymptotic methods, North Holland 1958, was a classic and was subsequently turned into a book in the well known Dover book series. His work on combinatorics yielded influential notions and theorems of which we mention the de Bruijn-sequences of 1946 and the de Bruijn-Erdos theorem of 1948. De Bruijn's contributions to mathematics also included his work on generalized function theory, analytic number theory, optimal control, quasicrystals, the mathematical analysis of games and much more. In the 1960s de Bruijn became fascinated by the new computer technology and as a result, decided to start the new AUTOMATH project where he could check, with the help of the computer, the correctness of books of mathematics. In each area that de Bruijn approached, he shed a new light and was known for his originality and for making deep intellectual contributions. And when it came to automating mathematics, he again did it his way and introduced the highly influential AUTOMATH. In the past decade he has also been working on theories of the human brain.
Del 29 - Applied Logic Series
Modern Perspective on Type Theory
From its Origins until Today
Inbunden, Engelska, 2004
1 932 kr
Skickas inom 10-15 vardagar
'Towards the end of the nineteenth century, Frege gave us the abstraction principles and the general notion of functions. Self-application of functions was at the heart of Russell's paradox. This led Russell to introduce type theory in order to avoid the paradox. Since, the twentieth century has seen an amazing number of theories concerned with types and functions and many applications. Progress in computer science also meant more and more emphasis on the use of logic, types and functions to study the syntax, semantics, design and implementation of programming languages and theorem provers, and the correctness of proofs and programs. The authors of this book have themselves been leading the way by providing various extensions of type theory which have been shown to bring many advantages. This book gathers much of their influential work and is highly recommended for anyone interested in type theory. The main emphasis is on: The first part of the book is historical, yet at the same time, places historical systems (like Russell's RTT) in the modern setting.The second part deals with modern type theory as it developed since the 1940s, and with the role of propositions as types (or proofs as terms), but at the same time, places another historical system (the proof checker Automath) in the modern setting. The third part uses this bridging in the first two parts between historical and modern systems to propose new systems that bring more advantages together. This book has much to offer to mathematicians, logicians and to computer scientists in general. It will have considerable influence for many years to come.' - Henk Barendregt
Del 28 - Applied Logic Series
Thirty Five Years of Automating Mathematics
Häftad, Engelska, 2010
1 076 kr
Skickas inom 10-15 vardagar
This volume is a collection of papers with a personal flavour. It consists of 11 articles which propose interesting variations to or examples of mechanising mathematics and illustrate differ developments in symbolic computation in the past 35 years. The volume further includes a strong argumentation by Arnon Avron that for automated reasoning, there is an interesting logic, somewhere strictly between first and second order logic, determined essentially by an analysis of transitive closure, yielding induction; and Murdoch Gabbay presenting an interesting generalisation of Fraenkel-Mostowski (FM) set theory within higher-order logic, and applying it to model Milner's p calculus.
Del 29 - Applied Logic Series
Modern Perspective on Type Theory
From its Origins until Today
Häftad, Engelska, 2010
1 397 kr
Skickas inom 10-15 vardagar
`Towards the end of the nineteenth century, Frege gave us the abstraction principles and the general notion of functions. Self-application of functions was at the heart of Russell's paradox. This led Russell to introduce type theory in order to avoid the paradox. Since, the twentieth century has seen an amazing number of theories concerned with types and functions and many applications. Progress in computer science also meant more and more emphasis on the use of logic, types and functions to study the syntax, semantics, design and implementation of programming languages and theorem provers, and the correctness of proofs and programs. The authors of this book have themselves been leading the way by providing various extensions of type theory which have been shown to bring many advantages. This book gathers much of their influential work and is highly recommended for anyone interested in type theory. The main emphasis is on:- Types: from Russell to Ramsey, to Church, to the modern Pure Type Systems and some of their extensions.- Functions: from Frege, to Russell to Church, to Automath and the use of functions in mathematics, programming languages and theorem provers.- The role of types in logic: Kripke's notion of truth, the evolution and role of the propositions as types concept and its use in logical frameworks.- The role of types in computation: extensions of type theories which can better model proof checkers and programming languages are given. The first part of the book is historical, yet at the same time, places historical systems (like Russell's RTT) in the modern setting. The second part deals with modern type theory as it developed since the 1940s, and with the role of propositions as types (or proofs as terms), but at the same time, places another historical system (the proof checker Automath) in the modern setting. The third part uses this bridging in the first two parts between historical and modern systems to propose new systems that bring more advantages together. This book has much to offer to mathematicians, logicians and to computer scientists in general. It will have considerable influence for many years to come.' - Henk Barendregt