Mathematical Theory of Domains
Title | Mathematical Theory of Domains PDF eBook |
Author | V. Stoltenberg-Hansen |
Publisher | Cambridge University Press |
Pages | 366 |
Release | 1994-09-22 |
Genre | Computers |
ISBN | 9780521383448 |
Introductory textbook/general reference in domain theory for professionals in computer science and logic.
Domains and Lambda-Calculi
Title | Domains and Lambda-Calculi PDF eBook |
Author | Roberto M. Amadio |
Publisher | Cambridge University Press |
Pages | 504 |
Release | 1998-07-02 |
Genre | Computers |
ISBN | 0521622778 |
Graduate text on mathematical foundations of programming languages, and operational and denotational semantics.
Non-Hausdorff Topology and Domain Theory
Title | Non-Hausdorff Topology and Domain Theory PDF eBook |
Author | Jean Goubault-Larrecq |
Publisher | Cambridge University Press |
Pages | 499 |
Release | 2013-03-28 |
Genre | Mathematics |
ISBN | 1107328772 |
This unique book on modern topology looks well beyond traditional treatises and explores spaces that may, but need not, be Hausdorff. This is essential for domain theory, the cornerstone of semantics of computer languages, where the Scott topology is almost never Hausdorff. For the first time in a single volume, this book covers basic material on metric and topological spaces, advanced material on complete partial orders, Stone duality, stable compactness, quasi-metric spaces and much more. An early chapter on metric spaces serves as an invitation to the topic (continuity, limits, compactness, completeness) and forms a complete introductory course by itself. Graduate students and researchers alike will enjoy exploring this treasure trove of results. Full proofs are given, as well as motivating ideas, clear explanations, illuminating examples, application exercises and some more challenging problems for more advanced readers.
Solving Problems in Multiply Connected Domains
Title | Solving Problems in Multiply Connected Domains PDF eBook |
Author | Darren Crowdy |
Publisher | SIAM |
Pages | 456 |
Release | 2020-04-20 |
Genre | Mathematics |
ISBN | 1611976154 |
Whenever two or more objects or entities—be they bubbles, vortices, black holes, magnets, colloidal particles, microorganisms, swimming bacteria, Brownian random walkers, airfoils, turbine blades, electrified drops, magnetized particles, dislocations, cracks, or heterogeneities in an elastic solid—interact in some ambient medium, they make holes in that medium. Such holey regions with interacting entities are called multiply connected. This book describes a novel mathematical framework for solving problems in two-dimensional, multiply connected regions. The framework is built on a central theoretical concept: the prime function, whose significance for the applied sciences, especially for solving problems in multiply connected domains, has been missed until recent work by the author. This monograph is a one-of-a-kind treatise on the prime function associated with multiply connected domains and how to use it in applications. The book contains many results familiar in the simply connected, or single-entity, case that are generalized naturally to any number of entities, in many instances for the first time. Solving Problems in Multiply Connected Domains is aimed at applied and pure mathematicians, engineers, physicists, and other natural scientists; the framework it describes finds application in a diverse array of contexts. The book provides a rich source of project material for undergraduate and graduate courses in the applied sciences and could serve as a complement to standard texts on advanced calculus, potential theory, partial differential equations and complex analysis, and as a supplement to texts on applied mathematical methods in engineering and science.
Domain Decomposition Methods - Algorithms and Theory
Title | Domain Decomposition Methods - Algorithms and Theory PDF eBook |
Author | Andrea Toselli |
Publisher | Springer Science & Business Media |
Pages | 454 |
Release | 2006-06-20 |
Genre | Mathematics |
ISBN | 3540266623 |
This book offers a comprehensive presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. It places strong emphasis on both algorithmic and mathematical aspects. It covers in detail important methods such as FETI and balancing Neumann-Neumann methods and algorithms for spectral element methods.
Cartesian Closed Categories of Domains
Title | Cartesian Closed Categories of Domains PDF eBook |
Author | A. Jung |
Publisher | |
Pages | 122 |
Release | 1989 |
Genre | Closed categories (Mathematics) |
ISBN |
A Mathematical Theory of Design: Foundations, Algorithms and Applications
Title | A Mathematical Theory of Design: Foundations, Algorithms and Applications PDF eBook |
Author | D. Braha |
Publisher | Springer Science & Business Media |
Pages | 684 |
Release | 2013-04-17 |
Genre | Technology & Engineering |
ISBN | 1475728727 |
Formal Design Theory (PDT) is a mathematical theory of design. The main goal of PDT is to develop a domain independent core model of the design process. The book focuses the reader's attention on the process by which ideas originate and are developed into workable products. In developing PDT, we have been striving toward what has been expressed by the distinguished scholar Simon (1969): that "the science of design is possible and some day we will be able to talk in terms of well-established theories and practices. " The book is divided into five interrelated parts. The conceptual approach is presented first (Part I); followed by the theoretical foundations of PDT (Part II), and from which the algorithmic and pragmatic implications are deduced (Part III). Finally, detailed case-studies illustrate the theory and the methods of the design process (Part IV), and additional practical considerations are evaluated (Part V). The generic nature of the concepts, theory and methods are validated by examples from a variety of disciplines. FDT explores issues such as: algebraic representation of design artifacts, idealized design process cycle, and computational analysis and measurement of design process complexity and quality. FDT's axioms convey the assumptions of the theory about the nature of artifacts, and potential modifications of the artifacts in achieving desired goals or functionality. By being able to state these axioms explicitly, it is possible to derive theorems and corollaries, as well as to develop specific analytical and constructive methodologies.