This book treats modal logic as a theory, with several subtheories, such as completeness theory, correspondence theory, duality theory and transfer theory and is intended as a course in modal logic for students who have had prior contact with modal logic and who wish to study it more deeply. It presupposes training in mathematical or logic. Very little specific knowledge is presupposed, most results which are needed are proved in this book.

This book has evolved from the lecture course on Functional Analysis I had given several times at the ETH. The text has a strict logical order, in the style of "Definition - Theorem - Proof - Example - Exercises". The proofs are rather thorough and there many examples. The first part of the book(the first three chapters, resp. the first two volumes) is devoted to the theory of Banach spaces in the most general sense of the term. The purpose of the first chapter (resp. first volume) is to introduce those results on Banach spaces which are used later or which are closely connected with the book. It therefore only contains a small part of the theory, and several results are stated (and proved) in a diluted form. The second chapter (which together with Chapter 3 makes the second volume) deals with Banach algebras (and involutive Banach algebras), which constitute the main topic of the first part of the book. The third chapter deals with compact operators on Banach spaces and linear (ordinary and partial) differential equations - applications of the, theory of Banach algebras.

This Handbook covers latent variable models, which are a flexible class of models for modeling multivariate data to explore relationships among observed and latent variables.
- Covers a wide class of important models
- Models and statistical methods described provide tools for analyzing a wide spectrum of complicated data
- Includes illustrative examples with real data sets from business, education, medicine, public health and sociology.
- Demonstrates the use of a wide variety of statistical, computational, and mathematical techniques.

Geometric Function Theory is that part of Complex Analysis which covers the theory of conformal and quasiconformal mappings.
Beginning with the classical Riemann mapping theorem, there is a lot of existence theorems for canonical conformal mappings. On the other side there is an extensive theory of qualitative properties of conformal and quasiconformal mappings, concerning mainly a prior estimates, so called distortion theorems (including the Bieberbach conjecture with the proof of the Branges). Here a starting point was the classical Scharz lemma, and then Koebe's distortion theorem.
There are several connections to mathematical physics, because of the relations to potential theory (in the plane). The Handbook of Geometric Function Theory contains also an article about constructive methods and further a Bibliography including applications eg: to electroxtatic problems, heat conduction, potential flows (in the plane).
- A collection of independent survey articles in the field of GeometricFunction Theory
- Existence theorems and qualitative properties of conformal and quasiconformal mappings
- A bibliography, including many hints to applications in electrostatics, heat conduction, potential flows (in the plane).

Calculation and optimisation of flight performance is required to design or select new aircraft, efficiently operate existing aircraft, and upgrade aircraft. It provides critical data for aircraft certification, accident investigation, fleet management, flight regulations and safety. This book presents an unrivalled range of advanced flight performance models for both transport and military aircraft, including the unconventional ends of the envelopes. Topics covered include the numerical solution of supersonic acceleration, transient roll, optimal climb of propeller aircraft, propeller performance, long-range flight with en-route stop, fuel planning, zero-gravity flight in the atmosphere, VSTOL operations, ski jump from aircraft carrier, optimal flight paths at subsonic and supersonic speed, range-payload analysis of fixed- and rotary wing aircraft, performance of tandem helicopters, lower-bound noise estimation, sonic boom, and more. This book will be a valuable text for undergraduate and post-graduate level students of aerospace engineering. It will also be an essential reference and resource for practicing aircraft engineers, aircraft operations managers and organizations handling air traffic control, flight and flying regulations, standards, safety, environment, and the complex financial aspects of flying aircraft.

This monograph provides a comprehensive treatment of expansion theorems for regular systems of first order differential equations and "n"-th order ordinary differential equations.
In 10 chapters and one appendix, it provides a comprehensive treatment from abstract foundations to applications in physics and engineering. The focus is on non-self-adjoint problems. Bounded operators are associated to these problems, and Chapter 1 provides an in depth investigation of eigenfunctions and associated functions for bounded Fredholm valued operators in Banach spaces. Since every "n"-th order differential equation is equivalent
to a first order system, the main techniques are developed for systems. Asymptotic fundamental
systems are derived for a large class of systems of differential equations. Together with boundary
conditions, which may depend polynomially on the eigenvalue parameter, this leads to the definition of Birkhoff and Stone regular eigenvalue problems. An effort is made to make the conditions relatively easy verifiable; this is illustrated with several applications in chapter 10.
The contour integral method and estimates of the resolvent are used to prove expansion theorems.
For Stone regular problems, not all functions are expandable, and again relatively easy verifiable
conditions are given, in terms of auxiliary boundary conditions, for functions to be expandable.
Chapter 10 deals exclusively with applications; in nine sections, various concrete problems such as
the Orr-Sommerfeld equation, control of multiple beams, and an example from meteorology are investigated.

Key features:
Expansion Theorems for Ordinary Differential Equations
Discusses Applications to Problems from Physics and Engineering
Thorough Investigation of Asymptotic Fundamental Matrices and Systems
Provides a Comprehensive Treatment
Uses the Contour Integral Method
Represents the Problems as Bounded Operators
Investigates Canonical Systems of Eigen- and Associated Vectors for Operator Functions
"

Mechatronics is a core subject for engineers, combining elements of mechanical and electronic engineering into the development of computer-controlled mechanical devices such as DVD players or anti-lock braking systems. This book is the most comprehensive text available for both mechanical and electrical engineering students and will enable them to engage fully with all stages of mechatronic system design. It offers broader and more integrated coverage than other books in the field with practical examples, case studies and exercises throughout and an Instructor's Manual. A further key feature of the book is its integrated coverage of programming the PIC microcontroller, and the use of MATLAB and Simulink programming and modelling, along with code files for downloading from the accompanying website.
*Integrated coverage of PIC microcontroller programming, MATLAB and Simulink modelling
*Fully developed student exercises, detailed practical examples
*Accompanying website with Instructor's Manual, downloadable code and image bank

The book is meant to serve two purposes. The first and more obvious one is to present state of the art results in algebraic research into residuated structures related to substructural logics. The second, less obvious but equally important, is to provide a reasonably gentle introduction to algebraic logic. At the beginning, the second objective is predominant. Thus, in the first few chapters the reader will find a primer of universal algebra for logicians, a crash course in nonclassical logics for algebraists, an introduction to residuated structures, an outline of Gentzen-style calculi as well as some titbits of proof theory - the celebrated Hauptsatz, or cut elimination theorem, among them. These lead naturally to a discussion of interconnections between logic and algebra, where we try to demonstrate how they form two sides of the same coin. We envisage that the initial chapters could be used as a textbook for a graduate course, perhaps entitled Algebra and Substructural Logics.
As the book progresses the first objective gains predominance over the second. Although the precise point of equilibrium would be difficult to specify, it is safe to say that we enter the technical part with the discussion of various completions of residuated structures. These include Dedekind-McNeille completions and canonical extensions. Completions are used later in investigating several finiteness properties such as the finite model property, generation of varieties by their finite members, and finite embeddability. The algebraic analysis of cut elimination that follows, also takes recourse to completions. Decidability of logics, equational and quasi-equational theories comes next, where we show how proof theoretical methods like cut elimination are preferable for small logics/theories, but semantic tools like Rabin's theorem work better for big ones. Then we turn to Glivenko's theorem, which says that a formula is an intuitionistic tautology if and only if its double negation is a classical one. We generalise it to the substructural setting, identifying for each substructural logic its Glivenko equivalence class with smallest and largest element. This is also where we begin investigating lattices of logics and varieties, rather than particular examples. We continue in this vein by presenting a number of results concerning minimal varieties/maximal logics. A typical theorem there says that for some given well-known variety its subvariety lattice has precisely such-and-such number of minimal members (where values for such-and-such include, but are not limited to, continuum, countably many and two). In the last two chapters we focus on the lattice of varieties corresponding to logics without contraction. In one we prove a negative result: that there are no nontrivial splittings in that variety. In the other, we prove a positive one: that semisimple varieties coincide with discriminator ones.
Within the second, more technical part of the book another transition process may be traced. Namely, we begin with logically inclined technicalities and end with algebraically inclined ones. Here, perhaps, algebraic rendering of Glivenko theorems marks the equilibrium point, at least in the sense that finiteness properties, decidability and Glivenko theorems are of clear interest to logicians, whereas semisimplicity and discriminator varieties are universal algebra par exellence. It is for the reader to judge whether we succeeded in weaving these threads into a seamless fabric.
- Considers both the algebraic and logical perspective within a common framework.
- Written by experts in the area.
- Easily accessible to graduate students and researchers from other fields.
- Results summarized in tables and diagrams to provide an overview of the area.
- Useful as a textbook for a course in algebraic logic, with exercises and suggested research directions.
- Provides a concise introduction to the subject and leads directly to research topics.
- The ideas from algebra and logic are developed hand-in-hand and the connections are shown in every level.

Mathematics for Electrical Engineering and Computing embraces many applications of modern mathematics, such as Boolean Algebra and Sets and Functions, and also teaches both discrete and continuous systems - particularly vital for Digital Signal Processing (DSP). In addition, as most modern engineers are required to study software, material suitable for Software Engineering - set theory, predicate and prepositional calculus, language and graph theory - is fully integrated into the book.
Excessive technical detail and language are avoided, recognising that the real requirement for practising engineers is the need to understand the "applications" of mathematics in everyday engineering contexts. Emphasis is given to an appreciation of the fundamental concepts behind the mathematics, for problem solving and undertaking critical analysis of results, whether using a calculator or a computer.
The text is backed up by numerous exercises and worked examples throughout, firmly rooted in engineering practice, ensuring that all mathematical theory introduced is directly relevant to real-world engineering. The book includes introductions to advanced topics such as Fourier analysis, vector calculus and random processes, also making this a suitable introductory text for second year undergraduates of electrical, electronic and computer engineering, undertaking engineering mathematics courses.
The book is supported with a number of free online resources. On the companion website readers will find:
* over 60 pages of "Background Mathematics" reinforcing introductory material for revision purposes in advance of your first year course
* plotXpose software (for equation solving, and drawing graphs of simple functions, their derivatives, integrals and Fourier transforms)
* problems and projects (linking directly to the software)
In addition, for lecturers only, http: //textbooks.elsevier.com features a complete worked solutions manual for the exercises in the book.
Dr Attenborough is a former Senior Lecturer in the School of Electrical, Electronic and Information Engineering at South Bank University. She is currently Technical Director of The Webbery - Internet development company, Co. Donegal, Ireland.
* Fundamental principles of mathematics introduced and applied in engineering practice, reinforced through over 300 examples directly relevant to real-world engineering
* Over 60 pages of basic revision material available to download in advance of embarking on a first year course
* Free website support, featuring complete solutions manual, background mathematics, plotXpose software, and further problems and projects enabling students to build on the concepts introduced, and put the theory into practice

Sobolev Spaces presents an introduction to the theory of Sobolev Spaces and other related spaces of function, also to the imbedding characteristics of these spaces. This theory is widely used in pure and Applied Mathematics and in the Physical Sciences.
This second edition of Adam's 'classic' reference text contains many additions and much modernizing and refining of material. The basic premise of the book remains unchanged: Sobolev Spaces is intended to provide a solid foundation in these spaces for graduate students and researchers alike.
* Self-contained and accessible for readers in other disciplines.
* Written at elementary level making it accessible to graduate students.

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.
The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.
One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.
The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.
-Emphasis is on relevant quantitative attributes of important results in complexity.
-Coverage is self-contained and accessible to a wide audience.
-Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology.

This volume introduces a unified, self-contained study of linear discrete parabolic problems through reducing the starting discrete problem to the Cauchy problem for an evolution equation in discrete time. Accessible to beginning graduate students, the book contains a general stability theory of discrete evolution equations in Banach space and gives applications of this theory to the analysis of various classes of modern discretization methods, among others, Runge-Kutta and linear multistep methods as well as operator splitting methods.

Key features:

* Presents a unified approach to examining discretization methods for parabolic equations.
* Highlights a stability theory of discrete evolution equations (discrete semigroups) in Banach space.
* Deals with both autonomous and non-autonomous equations as well as with equations with memory.
* Offers a series of numerous well-posedness and convergence results for various discretization methods as applied to abstract parabolic equations; among others, Runge-Kutta and linear multistep methods as well as certain operator splitting methods.
* Provides comments of results and historical remarks after each chapter.
. Presents a unified approach to examining discretization methods for parabolic equations.
. Highlights a stability theory of discrete evolution equations (discrete semigroups) in Banach space.
. Deals with both autonomous and non-autonomous equations as well as with equations with memory.
. Offers a series of numerous well-posedness and convergence results for various discretization methods as applied to abstract parabolic equations; among others, Runge-Kutta and linear multistep methods as well as certain operator splitting methods as well as certain operator splitting methods are studied in detail.
.Provides comments of results and historical remarks after each chapter."

The book presents a systematic and compact treatment of the qualitative theory of half-linear
differential equations. It contains the most updated and comprehensive material and represents the first attempt to present the results of the rapidly developing theory of half-linear differential equations in a unified form. The main topics covered by the book are oscillation and asymptotic theory and the theory of boundary value problems associated with half-linear equations, but the book also contains a treatment of related topics like PDE s with p-Laplacian, half-linear difference equations and various more general nonlinear differential equations.
- The first complete treatment of the qualitative theory of half-linear differential equations.
- Comparison of linear and half-linear theory.
- Systematic approach to half-linear oscillation and asymptotic theory.
- Comprehensive bibliography and index.
- Useful as a reference book in the topic.

This classic work has been fundamentally revised to take account of recent developments in general topology. The first three chapters remain unchanged except for numerous minor corrections and additional exercises, but chapters IV-VII and the new chapter VIII cover the rapid changes that have occurred since 1968 when the first edition appeared.
The reader will find many new topics in chapters IV-VIII, e.g. theory of Wallmann-Shanin's compactification, realcompact space, various generalizations of paracompactness, generalized metric spaces, Dugundji type extension theory, linearly ordered topological space, theory of cardinal functions, dyadic space, etc., that were, in the author's opinion, mostly special or isolated topics some twenty years ago but now settle down into the mainstream of general topology.

'Numbers and Proofs' presents a gentle introduction to the notion of proof to give the reader an understanding of how to decipher others' proofs as well as construct their own. Useful methods of proof are illustrated in the context of studying problems concerning mainly numbers (real, rational, complex and integers). An indispensable guide to all students of mathematics. Each proof is preceded by a discussion which is intended to show the reader the kind of thoughts they might have before any attempt proof is made. Established proofs which the student is in a better position to follow then follow.
Presented in the author's entertaining and informal style, and written to reflect the changing profile of students entering universities, this book will prove essential reading for all seeking an introduction to the notion of proof as well as giving a definitive guide to the more common forms. Stressing the importance of backing up "truths" found through experimentation, with logically sound and watertight arguments, it provides an ideal bridge to more complex undergraduate maths.

In its Second Edition, Handbook of Pulping and Papermaking is a comprehensive reference for industry and academia. The book offers a concise yet thorough introduction to the process of papermaking from the production of wood chips to the final testing and use of the paper product. The author has updated the extensive bibliography, providing the reader with easy access to the pulp and paper literature. The book emphasizes principles and concepts behind papermaking, detailing both the physical and chemical processes.
Key Features
* A comprehensive introduction to the physical and chemical processes in pulping and papermaking
* Contains an extensive annotated bibliography
* Includes 12 pages of color plates

This new text takes the reader from the very basics of analogue electronics to an introduction of state-of-the-art techniques used in the field. It is aimed at all engineering or science students who wish to study the subject from its first principles, as well as serving as a guide to more advanced topics for readers already familiar with the subject.
Attention throughout is focused on measurable terminal characteristics of devices, the way in which these give rise to equivalent circuits and methods of extracting parameter values for them from manufacturers data sheet specifications. In the practical application of these equivalent circuits, step-by-step analysis and design procedures are given where appropriate. Throughout the book, emphasis is given to the pictorial representation of information, and extensive use is made of mechanical analogues. This, combined with the self-assessment questions, copious exercises and worked examples result in an accessible introduction to a key area of electronics that even those with the most limited prior experience will find invaluable in their studies.

This text brings the reader to the frontiers of current research in topological rings. The exercises illustrate many results and theorems while a comprehensive bibliography is also included.

The book is aimed at those readers acquainted with some very basic point-set topology and algebra, as normally presented in semester courses at the beginning graduate level or even at the advanced undergraduate level. Familiarity with Hausdorff, metric, compact and locally compact spaces and basic properties of continuous functions, also with groups, rings, fields, vector spaces and modules, and with Zorn's Lemma, is also expected.

An Introduction to Electric Circuits is essential reading for first year students of electronics and electrical engineering who need to get to grips quickly with the basic theory. This text is a comprehensive introduction to the topic and, assuming virtually no knowledge, it keeps the mathematical content to a minimum.
As with other textbooks in the series, the format of this book enables the student to work at their own pace. It includes numerous worked examples throughout the text and graded exercises, with answers, at the end of each section.

This text provides an introduction to group theory with an emphasis on clear examples. The authors present groups as naturally occurring structures arising from symmetry in geometrical figures and other mathematical objects. Written in a 'user-friendly' style, where new ideas are always motivated before being fully introduced, the text will help readers to gain confidence and skill in handling group theory notation before progressing on to applying it in complex situations. An ideal companion to any first or second year course on the topic.

For more than forty years, the equation y (t) = Ay(t) + u(t) in Banach spaces has been used as model for optimal control processes described by partial differential equations, in particular heat and diffusion processes. Many of the outstanding open problems, however, have remained open until recently, and some have never been solved. This book is a survey of all results know to the author, with emphasis on very recent results (1999 to date).

The book is restricted to linear equations and two particular problems (the time optimal problem, the norm optimal problem) which results in a more focused and concrete treatment. As experience shows, results on linear equations are the basis for the treatment of their semilinear counterparts, and techniques for the time and norm optimal problems can often be generalized to more general cost functionals.

The main object of this book is to be a state-of-the-art monograph on the theory of the time and norm optimal controls for y (t) = Ay(t) + u(t) that ends at the very latest frontier of research, with open problems and indications for future research.

Key features:

. Applications to optimal diffusion processes.
. Applications to optimal heat propagation processes.
. Modelling of optimal processes governed by partial
differential equations.
. Complete bibliography.
. Includes the latest research on the subject.
. Does not assume anything from the reader except
basic functional analysis.
. Accessible to researchers and advanced graduate
students alike
. Applications to optimal diffusion processes.
. Applications to optimal heat propagation processes.
. Modelling of optimal processes governed by partial
differential equations.
. Complete bibliography.
. Includes the latest research on the subject.
. Does not assume anything from the reader except
basic functional analysis.
. Accessible to researchers and advanced graduate
students alike"

The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five years. A large proportion of them appear in the present volume.

The editors of this volume suggested that the authors should write comprehensive half-survey papers. This collection is therefore useful for everyone interested in the theory of tree languages as it covers most of the recent questions which are not treated in the very few rather old standard books on the subject. Trees appear naturally in many chapters of computer science and each new property is likely to result in improvement of some computational solution of a real problem in handling logical formulae, data structures, programming languages on systems, algorithms etc. The point of view adopted here is to put emphasis on the properties themselves and their rigorous mathematical exposition rather than on the many possible applications.

This volume is a useful source of concepts and methods which may be applied successfully in many situations: its philosophy is very close to the whole philosophy of the ESPRIT Basic Research Actions and to that of the European Association for Theoretical Computer Science.

This book (along with volume 2 covers most of the traditional methods for polynomial root-finding such as Newton s, as well as numerous variations on them invented in the last few decades. Perhaps more importantly it covers recent developments such as Vincent s method, simultaneous iterations, and matrix methods. There is an extensive chapter on evaluation of polynomials, including parallel methods and errors. There are pointers to robust and efficient programs. In short, it could be entitled A Handbook of Methods for Polynomial Root-finding . This book will be invaluable to anyone doing research in polynomial roots, or teaching a graduate course on that topic.

- First comprehensive treatment of Root-Finding in several decades.
- Gives description of high-grade software and where it can be down-loaded.
- Very up-to-date in mid-2006; long chapter on matrix methods.
- Includes Parallel methods, errors where appropriate.
- Invaluable for research or graduate course.

"