Handbook of recursive mathematics
Author : Ûrij Leonidovič Eršov
Publisher :
Page : 750 pages
File Size : 21,72 MB
Release : 1998
Category : Recursion theory
ISBN : 9780444501073
Author : Ûrij Leonidovič Eršov
Publisher :
Page : 750 pages
File Size : 21,72 MB
Release : 1998
Category : Recursion theory
ISBN : 9780444501073
Author : S.R. Buss
Publisher : Elsevier
Page : 823 pages
File Size : 39,11 MB
Release : 1998-07-09
Category : Mathematics
ISBN : 0080533183
This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth.The chapters are arranged so that the two introductory articles come first; these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science.
Author :
Publisher : Elsevier
Page : 799 pages
File Size : 19,44 MB
Release : 1998-11-30
Category : Computers
ISBN : 0080533701
Recursive Algebra, Analysis and Combinatorics
Author :
Publisher :
Page : 1372 pages
File Size : 30,18 MB
Release : 1998
Category : Recursion theory
ISBN : 9780444500038
Author : J. Barwise
Publisher : Elsevier
Page : 1179 pages
File Size : 35,73 MB
Release : 1982-03-01
Category : Computers
ISBN : 0080933645
The handbook is divided into four parts: model theory, set theory, recursion theory and proof theory. Each of the four parts begins with a short guide to the chapters that follow. Each chapter is written for non-specialists in the field in question. Mathematicians will find that this book provides them with a unique opportunity to apprise themselves of developments in areas other than their own.
Author :
Publisher : Elsevier
Page : 619 pages
File Size : 10,14 MB
Release : 1998-11-30
Category : Computers
ISBN : 9780080533698
Recursive Model Theory
Author : Piergiorgio Odifreddi
Publisher :
Page : 668 pages
File Size : 20,67 MB
Release : 1999
Category : Recursion theory
ISBN : 9780444589439
Author : Martha A. Tucker
Publisher : Bloomsbury Publishing USA
Page : 362 pages
File Size : 22,4 MB
Release : 2004-09-30
Category : Language Arts & Disciplines
ISBN : 0313053375
This book is a reference for librarians, mathematicians, and statisticians involved in college and research level mathematics and statistics in the 21st century. We are in a time of transition in scholarly communications in mathematics, practices which have changed little for a hundred years are giving way to new modes of accessing information. Where journals, books, indexes and catalogs were once the physical representation of a good mathematics library, shelves have given way to computers, and users are often accessing information from remote places. Part I is a historical survey of the past 15 years tracking this huge transition in scholarly communications in mathematics. Part II of the book is the bibliography of resources recommended to support the disciplines of mathematics and statistics. These are grouped by type of material. Publication dates range from the 1800's onwards. Hundreds of electronic resources-some online, both dynamic and static, some in fixed media, are listed among the paper resources. Amazingly a majority of listed electronic resources are free.
Author : David S. Gunderson
Publisher : Chapman & Hall/CRC
Page : 921 pages
File Size : 37,46 MB
Release : 2016-11-16
Category : Induction (Mathematics)
ISBN : 9781138199019
Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn's lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.
Author : Peter Cholak
Publisher : American Mathematical Soc.
Page : 338 pages
File Size : 40,84 MB
Release : 2000
Category : Mathematics
ISBN : 0821819224
This collection of articles presents a snapshot of the status of computability theory at the end of the millennium and a list of fruitful directions for future research. The papers represent the works of experts in the field who were invited speakers at the AMS-IMS-SIAM 1999 Summer Conference on Computability Theory and Applications, which focused on open problems in computability theory and on some related areas in which the ideas, methods, and/or results of computability theory play a role. Some presentations are narrowly focused; others cover a wider area. Topics included from "pure" computability theory are the computably enumerable degrees (M. Lerman), the computably enumerable sets (P. Cholak, R. Soare), definability issues in the c.e. and Turing degrees (A. Nies, R. Shore) and other degree structures (M. Arslanov, S. Badaev and S. Goncharov, P. Odifreddi, A. Sorbi). The topics involving relations between computability and other areas of logic and mathematics are reverse mathematics and proof theory (D. Cenzer and C. Jockusch, C. Chong and Y. Yang, H. Friedman and S. Simpson), set theory (R. Dougherty and A. Kechris, M. Groszek, T. Slaman) and computable mathematics and model theory (K. Ambos-Spies and A. Kucera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).