You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book consists of several survey and research papers covering a wide range of topics in active areas of set theory and set theoretic topology. Some of the articles present, for the first time in print, knowledge that has been around for several years and known intimately to only a few experts. The surveys bring the reader up to date on the latest information in several areas that have been surveyed a decade or more ago. Topics covered in the volume include combinatorial and descriptive set theory, determinacy, iterated forcing, Ramsey theory, selection principles, set-theoretic topology, and universality, among others. Graduate students and researchers in logic, especially set theory, descriptive set theory, and set-theoretic topology, will find this book to be a very valuable reference.
A coherent, self-contained treatment of the central topics of real analysis employing modern infinitesimals.
Currently, nonstandard analysis is barely considered in university teaching. The author argues that nonstandard analysis is valuable not only for teaching, but also for understanding standard analysis and mathematics itself. An axiomatic approach wich pays attention to different language levels (for example, in the distinction between sums of ones and the natural numbers of the theory) leads naturally to a nonstandard theory. For motivation historical ideas of Leibniz can be taken up. The book contains an elaborated concept that follows this approach and is suitable, for example, as a basis for a lecture-supplementary course. The monograph part presents all major approaches to nonstandard an...
At first glance, Robinson's original form of nonstandard analysis appears nonconstructive in essence, because it makes a rather unrestricted use of classical logic and set theory and, in particular, of the axiom of choice. Recent developments, however, have given rise to the hope that the distance between constructive and nonstandard mathematics is actually much smaller than it appears. So the time was ripe for the first meeting dedicated simultaneously to both ways of doing mathematics – and to the current and future reunion of these seeming opposites. Consisting of peer-reviewed research and survey articles written on the occasion of such an event, this volume offers views of the continuum from various standpoints. Including historical and philosophical issues, the topics of the contributions range from the foundations, the practice, and the applications of constructive and nonstandard mathematics, to the interplay of these areas and the development of a unified theory.
This book is the proceedings of Falk Symposium 128, held in Würzburg, Germany, on May 2-3, 2002, and dedicated to the important issue of colonic carcinogenesis and its underlying genetic and environmental factors. Colorectal cancer is one of the leading causes of cancer-related death in industrialized countries. It has been recognized to be the consequence of a dynamic process leading from hyperproliferative epithelium through different classes of adenomas to invasive carcinoma. This adenoma-carcinoma sequence has been characterized on a molecular basis. Modern molecular biology has also helped to clarify the clustering of colorectal cancer within families, a phenomenon that has been known ...
This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, ?1-induction, completeness of Le?niewski's systems, and reduction calculus for the satisfiability problem are also discussed.The coverage includes the answer to Kanovei's question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuo...
This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, Δ1-induction, completeness of Leśniewski's systems, and reduction calculus for the satisfiability problem are also discussed.The coverage includes the answer to Kanovei's question about the upper bound for the complexity of equivalence relations by convergence at infinity for contin...
A compilation of papers presented at the 1999 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '99 includes surveys and research articles from some of the world's preeminent logicians. Two long articles are based on tutorials given at the meeting and present accessible expositions of current research in two active are