Books in Mathematics

The Mathematics collection presents a range of foundational and advanced research content across applied and discrete mathematics, including fields such as Computational Mathematics; Differential Equations; Linear Algebra; Modelling & Simulation; Numerical Analysis; Probability & Statistics.

Books Journals

A Mathematical Introduction to Logic

2nd Edition
December 22, 2000
Herbert B. Enderton
English
eBook
9 7 8 0 0 8 0 4 9 6 4 6 7

A Mathematical Introduction to Logic

2nd Edition
December 22, 2000
Herbert B. Enderton
English
eBook
9 7 8 0 0 8 0 4 9 6 4 6 7

A Matlab Companion for Multivariable Calculus

1st Edition
December 18, 2000
Jeffery Cooper
English
Paperback
9 7 8 0 1 2 1 8 7 6 2 5 8
eBook
9 7 8 0 0 8 0 4 8 9 3 6 0

Offering a concise collection of MatLab programs and exercises to accompany a third semester course in multivariable calculus, A MatLab Companion for Multivariable Calculus introduces simple numerical procedures such as numerical differentiation, numerical integration and Newton's method in several variables, thereby allowing students to tackle realistic problems. The many examples show students how to use MatLab effectively and easily in many contexts. Numerous exercises in mathematics and applications areas are presented, graded from routine to more demanding projects requiring some programming. Matlab M-files are provided on the Harcourt/Academic Press web site at http://www.harcourt-...

Homology

1st Edition
December 18, 2000
Brian K. Hall
English
eBook
9 7 8 0 0 8 0 5 7 4 3 0 1

The application of homology varies depending on the data being examined. This volume represents a state-of-the-art treatment of the different applications of this unifying concept. Chapters deal with homology on all levels, from molecules to behavior, and are authored by leading contributors to systematics, natural history, and evolutionary, developmental, and comparative biology. This paperback reprint of the original hardbound edition continues to commemorate the 150th anniversary of Sir Richard Owen's seminal paper distinguishing homology from analogy.

Theory of Relations

1st Edition
Volume 145
December 15, 2000
R. Fraisse
English
Hardback
9 7 8 0 4 4 4 5 0 5 4 2 2
eBook
9 7 8 0 0 8 0 5 1 9 1 1 1

Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by Dushnik, Miller 1940 who, starting from the chain of reals, obtained an infinite strictly decreasing sequence of chains (of continuum power) with respect to embeddability. In 1948 I conjectured that every strictly decreasing sequence of denumerable chains is finite. This was affirmatively proved by Laver (1968), in the more general case of denumerable unions of scattered chains (ie: which do not embed the chain Q of rationals), by using the barrier and the better orderin gof Nash-Williams (1965 to 68).Another important problem is the extension to posets of classical properties of chains. For instance one easily sees that a chain A is scattered if the chain of inclusion of its initial intervals is itself scattered (6.1.4). Let us again define a scattered poset A by the non-embedding of Q in A. We say that A is finitely free if every antichain restriction of A is finite (antichain = set of mutually incomparable elements of the base). In 1969 Bonnet and Pouzet proved that a poset A is finitely free and scattered iff the ordering of inclusion of initial intervals of A is scattered. In 1981 Pouzet proved the equivalence with the a priori stronger condition that A is topologically scattered: (see 6.7.4; a more general result is due to Mislove 1984); ie: every non-empty set of initial intervals contains an isolated elements for the simple convergence topology.In chapter 9 we begin the general theory of relations, with the notions of local isomorphism, free interpretability and free operator (9.1 to 9.3), which is the relationist version of a free logical formula. This is generalized by the back-and-forth notions in 10.10: the (k,p)-operator is the relationist version of the elementary formula (first order formula with equality).Chapter 12 connects relation theory with permutations: theorem of the increasing number of orbits (Livingstone, Wagner in 12.4). Also in this chapter homogeneity is introduced, then more deeply studied in the Appendix written by Norbert Saucer.Chapter 13 connects relation theory with finite permutation groups; the main notions and results are due to Frasnay. Also mention the extension to relations of adjacent elements, by Hodges, Lachlan, Shelah who by this mean give an exact calculus of the reduction threshold.The book covers almost all present knowledge in Relation Theory, from origins (Hausdorff 1914, Sierpinski 1928) to classical results (Frasnay 1965, Laver 1968, Pouzet 1981) until recent important publications (Abraham, Bonnet 1999).All results are exposed in axiomatic set theory. This allows us, for each statement, to specify if it is proved only from ZF axioms of choice, the continuum hypothesis or only the ultrafilter axiom or the axiom of dependent choice, for instance.

Quantum Theoretic Machines

1st Edition
December 8, 2000
A. Stern
English
eBook
9 7 8 0 0 8 0 5 4 0 1 3 9

Making Sense of Inner Sense'Terra cognita' is terra incognita. It is difficult to find someone not taken abackand fascinated by the incomprehensible but indisputable fact: there are material systems which are aware of themselves. Consciousness is self-cognizing code. During homo sapiens's relentness and often frustrated search for self-understanding various theories of consciousness have been and continue to be proposed. However, it remains unclear whether and at what level the problems of consciousness and intelligent thought can be resolved. Science's greatest challenge is to answer the fundamental question: what precisely does a cognitive state amount to in physical terms?Albert Einstein insisted that the fundamental ideas of science are essentially simple and can be expressed in a language comprehensible to everyone. When one thinks about the complexities which present themselves in modern physics and even more so in the physics of life, one may wonder whether Einstein really meant what he said. Are we to consider the fundamental problem of the mind, whose understanding seems to lie outside the limits of the mind, to be essentially simple too? Knowledge is neither automatic nor universally deductive. Great new ideas are typically counterintuitive and outrageous, and connecting them by simple logical steps to existing knowledge is often a hard undertaking. The notion of a tensor was needed to provide the general theory of relativity; the notion of entropy had to be developed before we could get full insight into the laws of thermodynamics; the notice of information bit is crucial for communication theory, just as the concept of a Turing machine is instrumental in the deep understanding of a computer. To understand something, consciousness must reach an adequate intellectual level, even more so in order to understand itself. Reality is full of unending mysteries, the true explanation of which requires very technical knowledge, often involving notions not given directly to intuition. Even though the entire content and the results of this study are contained in the eight pages of the mathematical abstract, it would be unrealistic and impractical to suggest that anyone can gain full insight into the theory that presented here after just reading abstract.In our quest for knowledge we are exploring the remotest areas of the macrocosm and probing the invisible particles of the microcosm, from tiny neutrinos and strange quarks to black holes and the Big Bang. But the greatest mystery is very close to home: the greatest mystery is human consciousness. The question before us is whether the logical brain has evolved to a conceptual level where it is able to understand itself.

Game Theory

1st Edition
December 1, 2000
A. J. Jones
English
Paperback
9 7 8 1 8 9 8 5 6 3 1 4 3
eBook
9 7 8 0 8 5 7 0 9 9 6 9 3

Written engagingly and with agreeable humour, this book balances a light touch with a rigorous yet economical account of the theory of games and bargaining models. It provides a precise interpretation, discussion and mathematical analysis for a wide range of “game-like” problems in economics, sociology, strategic studies and war.There is first an informal introduction to game theory, which can be understood by non-mathematicians, which covers the basic ideas of extensive form, pure and mixed strategies and the minimax theorem. The general theory of non-cooperative games is then given a detailed mathematical treatment in the second chapter. Next follows a “first class” account of linear programming, theory and practice, terse, rigorous and readable, which is applied as a tool to matrix games and economics from duality theory via the equilibrium theorem, with detailed explanations of computational aspects of the simplex algorithm.The remaining chapters give an unusually comprehensive but concise treatment of cooperative games, an original account of bargaining models, with a skillfully guided tour through the Shapley and Nash solutions for bimatrix games and a carefully illustrated account of finding the best threat strategies.

Topological Algebras

1st Edition
Volume 185
November 23, 2000
V.K. Balachandran
English
eBook
9 7 8 0 0 8 0 5 4 3 0 8 6

This book consists of nine chapters. Chapter 1 is devoted to algebraic preliminaries. Chapter 2 deals with some of the basic definition and results concerning topological groups, topological linear spaces and topological algebras. Chapter 3 considered some generalizations of the norm. Chapter 4 is concerned with a generalization of the notion of convexity called p-convexity. In Chapter 5 some differential and integral analysis involving vector valued functions is developed. Chapter 6 is concerned with spectral analysis and applications. The Gelfand representation theory is the subject-matter of Chapter 7. Chapter 8 deals with commutative topological algebras. Finally in Chapter 9 an exposition of the norm uniqueness theorems of Gelfand and Johnson (extended to p-Banach algebras) is given.

From Peirce to Skolem

1st Edition
Volume 4
November 22, 2000
Geraldine Brady
English
eBook
9 7 8 0 0 8 0 5 3 2 0 2 8

This book is an account of the important influence on the development of mathematical logic of Charles S. Peirce and his student O.H. Mitchell, through the work of Ernst Schröder, Leopold Löwenheim, and Thoralf Skolem. As far as we know, this book is the first work delineating this line of influence on modern mathematical logic.

Handbook of Numerical Analysis

1st Edition
Volume 7
November 21, 2000
Philippe G. Ciarlet
English
Hardback
9 7 8 0 4 4 4 5 0 3 5 0 3

These volumes cover all the major aspects of numerical analysis. This particular volume discusses the solution of equations in Rn, Gaussian elimination, techniques of scientific computer, the analysis of multigrid methods, wavelet methods, and finite volume methods.

Related subjects

Mathematics and applied mathematics

Statistics and probability

Life Sciences

Physical Sciences & Engineering

Social Sciences & Humanities

Health

Books in Mathematics

A Mathematical Introduction to Logic

A Mathematical Introduction to Logic

A Matlab Companion for Multivariable Calculus

Homology

Theory of Relations

Quantum Theoretic Machines

Game Theory

Topological Algebras

From Peirce to Skolem

Handbook of Numerical Analysis

Related subjects