This research monograph considers the subject of asymptotics from a nonstandard view point. It is intended both for classical asymptoticists - they will discover a new approach to problems very familiar to them - and for nonstandard analysts but includes topics of general interest, like the remarkable behaviour of Taylor polynomials of elementary functions. Noting that within nonstandard analysis, "small," "large," and "domain of validity of asymptotic behaviour" have a precise meaning, a nonstandard alternative to classical asymptotics is developed. Special emphasis is given to applications in numerical approximation by convergent and divergent expansions: in the latter case a clear asymptotic answer is given to the problem of optimal approximation, which is valid for a large class of functions including many special functions. The author's approach is didactical. The book opens with a large introductory chapter which can be read without much knowledge of nonstandard analysis. Here the main features of the theory are presented via concrete examples, with many numerical and graphic illustrations. N

MATLAB lost die Mathematikaufgaben der Technik und Naturwissenschaften. Dieses Buch eignet sich als Einfuhrung fur den Einsteiger in MATLAB, als begleitendes Ubungsbuch fur Horer von Mathematikvorlesungen, als Nachschlagewerk fur Dozenten und Praktiker. Es enthalt zu allen behandelten mathematischen Problemen typische mit MATLAB geloste Beispiele. Der Leser lernt so die Anwendung von MATLAB und die Interpretation der Ergebnisse. Die konkreten Beispiele beziehen sich auf Release 5.3, was jedoch keine Einschrankung fur das Erlernen von MATLAB bedeutet."

This volume contains abridged versions of most of the sectional talks and some invited lectures given at the International Conference on Fundamentals of Computation Theory held at Kazan State University, Kazan, USSR, June 22-26, 1987. The conference was the sixth in the series of FCT Conferences organized every odd year, and the first one to take place in the USSR. FCT '87 was organized by the Section of Discrete Mathematics of the Academy of Sciences in the USSR, the Moscow State University (Department of Discrete Mathematics), and the Kazan State University (Department of Theoretical Cybernetics). This volume contains selected contributions to the following fields: Mathematical Models of Computation, Synthesis and Complexity of Control Systems, Probabilistic Computations, Theory of Programming, Computer-Assisted Deduction. The volume reflects the fact that FCT '87 was organized in the USSR: A wide range of problems typical of research in Mathematical Cybernetics in the USSR is comprehensively represented.

This book is designed for use in a one semester problem-oriented course in undergraduate set theory. The combination of level and format is somewhat unusual and deserves an explanation. Normally, problem courses are offered to graduate students or selected undergraduates. I have found, however, that the experience is equally valuable to ordinary mathematics majors. I use a recent modification of R. L. Moore's famous method developed in recent years by D. W. Cohen 1]. Briefly, in this new approach, projects are assigned to groups of students each week. With all the necessary assistance from the instructor, the groups complete their projects, carefully write a short paper for their classmates, and then, in the single weekly class meeting, lecture on their results. While the em phasis is on the student, the instructor is available at every stage to assure success in the research, to explain and critique mathematical prose, and to coach the groups in clear mathematical presentation. The subject matter of set theory is peculiarly appropriate to this style of course. For much of the book the objects of study are familiar and while the theorems are significant and often deep, it is the methods and ideas that are most important. The necessity of rea soning about numbers and sets forces students to come to grips with the nature of proof, logic, and mathematics. In their research they experience the same dilemmas and uncertainties that faced the pio neers."

The generic term "graph-grammars" refers to a variety of methods for specifying (possibly infinite) sets of graphs or sets of maps. The area of graph-grammars originated in the late 60s motivated by considerations concerning pattern recognition - since then the list of areas which have interacted with the development of graph-grammars has grown quite impressively. It includes pattern recognition, software specification and development, VLSI layout schemes, data bases, lambda-calculus, analysis of concurrent systems, massively parallel computer architectures, incremental compilers, computer animation, complexity theory, developmental biology, music composition, representation of physical solids, and many others. This volume is based on the contributions presented at the third international workshop on graph-grammars and their applications, held in Warrenton, Virginia, USA in December 1986. Aiming at the best possible representation of the field not all of the papers presented at the meeting appear in this volume and some of the papers from this volume were not presented at the workshop. The volume consists of two parts: Part I presents tutorial introductions to a number of basic graph and map rewriting mechanisms. Part II contains technical contributions. This collection of papers provides the reader with an up-to-date overview of current trends in graph-grammars.

This book presents the proceedings of the Sixth International Conference on Category Theory and Computer Science, CTCS '95, held in Cambridge, UK in August 1995.The 15 revised full papers included in the volume document the exploitation of links between logic and category theory leading to a solid basis for much of the understanding of the semantics of computation. Notable amongst other advances is the introduction of linear logic and other substructural logics, providing a new approach to proof theory. Further aspects covered are semantics of lambda calculi and type theories, program specification and development, and domain theory.

This is an introduction to, and survey of, the constructive approaches to pure mathematics. The authors emphasise the viewpoint of Errett Bishop's school, but intuitionism. Russian constructivism and recursive analysis are also treated, with comparisons between the various approaches included where appropriate. Constructive mathematics is now enjoying a revival, with interest from not only logicans but also category theorists, recursive function theorists and theoretical computer scientists. This account for non-specialists in these and other disciplines.

The surreal numbers form a system which includes both the ordinary real numbers and the ordinals. Since their introduction by J. H. Conway, the theory of surreal numbers has seen a rapid development revealing many natural and exciting properties. These notes provide a formal introduction to the theory in a clear and lucid style. The the author is able to lead the reader through to some of the problems in the field. The topics covered include exponentiation and generalized e-numbers.

It is Sunday, the 7th of September 1930. The place is Konigsberg and the occasion is a small conference on the foundations of mathematics. Arend Heyting, the foremost disciple of L. E. J. Brouwer, has spoken on intuitionism; Rudolf Carnap of the Vienna Circle has expounded on logicism; Johann (formerly Janos and in a few years to be Johnny) von Neumann has explained Hilbert's proof theory-- the so-called formalism; and Hans Hahn has just propounded his own empiricist views of mathematics. The floor is open for general discussion, in the midst of which Heyting announces his satisfaction with the meeting. For him, the relationship between formalism and intuitionism has been clarified: There need be no war between the intuitionist and the formalist. Once the formalist has successfully completed Hilbert's programme and shown "finitely" that the "idealised" mathematics objected to by Brouwer proves no new "meaningful" statements, even the intuitionist will fondly embrace the infinite. To this euphoric revelation, a shy young man cautions "According to the formalist conception one adjoins to the meaningful statements of mathematics transfinite (pseudo-')statements which in themselves have no meaning but only serve to make the system a well-rounded one just as in geometry one achieves a well rounded system by the introduction of points at infinity."

Absolute values and their completions - like the p-adic number fields- play an important role in number theory. Krull's generalization of absolute values to valuations made applications in other branches of mathematics, such as algebraic geometry, possible. In valuation theory, the notion of a completion has to be replaced by that of the so-called Henselization.

In this book, the theory of valuations as well as of Henselizations is developed. The presentation is based on the knowledge aquired in a standard graduate course in algebra. The last chapter presents three applications of the general theory -as to Artin's Conjecture on the p-adic number fields- that could not be obtained by the use of absolute values only.